A program must be implemented that shows the computation of a machine

of Turing $M=(K,,,s,H)$ for a given input $w.$ The program should receive as much

$M$ and $w$ as input parameters, start computation in configuration

$(s,w)$ and print the stop configuration $($both the state and the content of the

tape$),$ if $M$ reaches a stop configuration. If$,$ after an amount

previously established X of transitions, the machine does not reach a

stopped, the user must be asked to confirm whether they wish to continue processing

applying the transition function up to X times. There must be an option that allows

visualization of all configurations present in the computation, from configuration

start to stop setting.$|$

Transactions must follow the pattern below, e$.$g$.$

transicao $=\{$

$(\text{'}$q$0\text{'},\text{'}$a$\text{'})$: $(\text{'}$q$1\text{'},\text{'}$S$\text{'}),$

$(\text{'}$q$0\text{'},\text{'}$b$\text{'})$: $(\text{'}$q$1\text{'},\text{'}$S$\text{'}),$

$(\text{'}$q$0\text{'},\text{'}\_\text{'})$: $(\text{'}$h$\text{'},\text{'}$S$\text{'}),$

$(\text{'}$q$0\text{'},\text{'}>\text{'})$: $(\text{'}$q$0\text{'},\text{'}$R$\text{'}),$

$(\text{'}$q$1\text{'},\text{'}$a$\text{'})$: $(\text{'}$q$0\text{'},\text{'}$R$\text{'}),$

$(\text{'}$q$1\text{'},\text{'}$b$\text{'})$: $(\text{'}$q$0\text{'},\text{'}$R$\text{'}),$

$(\text{'}$q$1\text{'},\text{'}\_\text{'})$: $(\text{'}$q$0\text{'},\text{'}$R$\text{'}),$

$(\text{'}$q$1\text{'},\text{'}>\text{'})$: $(\text{'}$q$1\text{'},\text{'}$R$\text{'}$

$)$

$\}$