CameraIcon
CameraIcon
SearchIcon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question

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)

flag
Suggest Corrections
thumbs-up
0
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Arithmetic Progression
MATHEMATICS
Watch in App
Join BYJU'S Learning Program
CrossIcon