engineering recuitment GATE CSE 2023-24 Test Series Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability Turing Machines
Consider a Turing machine M given below that accepts the language.
L = {bnan+1 |n ≥ 1}
B in ‘M’ represents Blank symbol.
What will be the missing part/transition for P and Q respectively in the given Turing machine?
1
(a, x, L) and (a, y, R)
2
(a, a, R) and (a, y, L)
3
(a, y, L) and (a, a, R)
4
(a, y, R) and (a, x, L)