0 votes 0 votes 1. Every TM can be converted to another TM with 2 states. 2. Every TM can be converted to another TM with 3 states. 3. Every TM can be converted to another TM with 1 state. Which of above are true?? Theory of Computation non-gate + – thor asked Nov 16, 2016 • reopened Nov 16, 2016 by Arjun thor 396 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes This is not in the scope of GATE. http://cs.stackexchange.com/questions/4801/how-to-calculate-the-number-of-states-in-designing-a-turing-machine Arjun answered Nov 16, 2016 Arjun comment Share Follow See all 2 Comments See all 2 2 Comments reply thor commented Nov 16, 2016 reply Follow Share but there was a true false question can every turing machine can be reducible to a TM with 2 states in ME test 0 votes 0 votes Arjun commented Nov 16, 2016 reply Follow Share ME is not GATE :X 3 votes 3 votes Please log in or register to add a comment.