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 MonikaV asked May 19, 2019 MonikaV 227 views answer comment Share Follow See 1 comment See all 1 1 comment reply Satbir commented May 20, 2019 reply Follow Share opton d ? 0 votes 0 votes Please log in or register to add a comment.