in Theory of Computation
229 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

in Theory of Computation
by
229 views

1 comment

opton d ?
0
0

Please log in or register to answer this question.