0 votes 0 votes You may have noticed that all the examples in these sections had only one final state. Is it generally true that for any Turing machine, there exists another one with only one final state that accepts the same language$?$ Theory of Computation peter-linz peter-linz-edition5 theory-of-computation turing-machine proof + – Rishi yadav asked Apr 9, 2019 Rishi yadav 161 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.