Number of symbols necessary to simulate a Turing with m symbols and n states TOC 0 Ravi Garg 3 Rep. December 7, 2015 Please explain: Number of symbols necessary to simulate a Turing Machine with m symbols and n states is (a) mn (b)2m(n+m) (c)4mn+m (d)8mn+4m Ravi Garg edited question January 14, 2016 1 answer ActiveVotedNewestOldest 0 Ankit Lath (anonymous) January 9, 2016 i have read the statement that 4mn+m symbols are necessary to simulate TM with m symbols & n states but do’nt know how, so if anybody know the explanation then pls post Ankit Lath answered January 8, 2016 Toggle fullscreen Write Add image to editor add image from link NamePost answer Follow 1 Question stats ActiveJanuary 14, 2016Views404 timesAnswers1 answerFollowers1 follower Question and answer is powered by AnsPress