Consider the state diagram of Turing Machine T, over ∑={a}andΓ={a,□}.
The language accepted by T will be
Open in App
Solution
The Turing Machine T is accepting regular language (aaa)* as [number o fa's = 3x + 2]. This isbecause the state is q2 instead of q0, Had initial state been q0, language would have been a(aaa)*So correct choice is option (c)