125 views
0 votes
0 votes
$\text{Example}:$ For $\Sigma = \{a,b\}$ design a Turing machine that accepts

                                                                               $L = \{a^nb^n:n\geq 1\}$.

Is there any input for which the Turing machine in Example goes into an infinite loop$?$

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
0 votes
0 votes
0 answers
2
0 votes
0 votes
0 answers
3
0 votes
0 votes
0 answers
4