Register

Doubt: TOC: Turing Machine

797 views
4 4 votes

Following screenshot is taken from Sipser's book:

This Turing Machine accepts  the language L = {w#w | w ∈ {0, 1}*}, my doubt is, what is the need of keeping transition for 0 and 1 on the state q6, if it is x->L in place 0, 1, x -> L on state q6 then also this machine is correct.  

Am I missing something

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Geeksforgeeks quizNext → · Is it regular ?
← Previous in category · TOC - DoubtNext in category → · Is it regular ?
Position:
Show:

Related questions

3 3 votes
1 answers 1 answer
1.5k
1.5k views
hitesh159 asked May 28, 2019
1,451 views
ace academy test series toc turing machine
3 3 votes
2 2 answers
2.0k
2.0k views
srestha asked Apr 30, 2019
2,045 views
Made Easy Test Series:TOC-Turing Machine
$P_{1}:$ {$<M>|M $ is a TM that accepts atleast $2$ strings of different length}$P_{2}:$ {$<M>|M $ is a TM and there exists an input whose length less than $100,$ on whi...
3 3 votes
2 2 answers
1.7k
1.7k views
Anurag Aizen Mukherj asked Jan 20, 2019
1,717 views
TOC-Turing Machine
Consider the given below Turing Machine and identify the correct language accepted:(a+b)*aa(a+b)*b*a(bb*a)*ab*ab*aNone of theseThe answer is given as (1). But I think (3)...
0 0 votes
0 0 answers
821
821 views
KISHALAY DAS asked Dec 10, 2016
821 views
TOC-Turing Machine REL