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$?$ Theory of Computation peter-linz peter-linz-edition5 theory-of-computation turing-machine + – Rishi yadav asked Apr 3, 2019 Rishi yadav 125 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.