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
64.3k questions
77.9k answers
244k comments
80.0k users