engineering recuitment GATE CSE 2023-24 Test Series Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability Turing Machines
Consider the following Turing machine:
Note: (p, q, r) represents that by reading input 'p', it replaces 'p' by 'q' and moves to 'r' direction. Which of the following languages is accepted by the above Turing machine?
1
{0n1n/ n>=1}
2
{1n0n/ n>=1}
3
{0n1n/ n>=0}
4
{1n0n/ n>=0}