1 year ago

For the following Turing Machine, test whether the string “( ) ) )” is accepted or rejected and represent it in transition diagram.

State X Action (Write, Move, New State) Y Action (Write, Move, New State) B Action (Write, Move, New State)

q₀ ( X,R,q₁ , , , ,

q1 ) X,L,q₂ $Y, L, q_{2}$ Y,L,q₂

q2 X X,R,q₀ Y Y,R,q₃ ,

q3 , , , , ,

This question doesn't have any answer. Please request admin for answer or submit your own answer.

Submit Answer

0 Comments

Oldest

Newest Most Voted

Question