Question: The following is a Turing machine which is a nondeterministic acceptor. q0 a q1 b L q0 b q1 a L q1 a q0 a
The following is a Turing machine which is a nondeterministic acceptor. q0 a q1 b L q0 b q1 a L q1 a q0 a R q1 b q1 a L q1 b q0 b R q1 c ACCEPT Assume that this acceptor starts in state q0, at the right hand end of the input tape.
(a) Show that the string cab is ACCEPTED. (b) Show that the string caa is NOT ACCEPTED. (c) Is the string caabcaab accepted???.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
