260 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

3.2k
views
1 answers
0 votes
sushmita asked Feb 23, 2017
3,237 views
366
views
0 answers
0 votes
Deepak Yadav asked Aug 23, 2017
366 views
What is the answer of this question with explanation?
566
views
0 answers
0 votes
Vikram Saurabh asked May 3, 2018
566 views
Please help me with this question..The CPU of a system having an execution rate of 1 million instructions per second needs 4 machine cycles on an average ... check-status, branch and read/write in memory, each requiring one machine cycle.
194
views
0 answers
0 votes