523 views
0 votes
0 votes

As per the given solution,B should be the correct answer right why is D given as the correct answer as the machine accepts atleast one b.

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
1
Akash Mishra asked Sep 11, 2017
1,116 views
Is this language L accepted by a Turing Machine?L = a1n a2n a3n a4n .........amn || m,n 0Also, what about this language?L = a1n a2n a3n a4n .........ann || n 0
0 votes
0 votes
2 answers
3
Mk Utkarsh asked Nov 26, 2017
2,012 views
If total turing machine is a proper subset of turing machine then why recursive language is not a proper subset of Recursive Enumerable ?
0 votes
0 votes
1 answer
4