227 views
0 votes
0 votes

Which of the following is not true about Turing machine?

(a) It can accept any palindrome

(b) It can accept any context free language

(c) It can accept {a^m b^n c^mn:m,n>=0

(d) One tape Turing machine can be converted into C++ programs

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
1
sushmita asked Feb 23, 2017
3,109 views
0 votes
0 votes
0 answers
2
Deepak Yadav asked Aug 23, 2017
341 views
What is the answer of this question with explanation?
0 votes
0 votes
0 answers
4