0 votes 0 votes Show that single-tape $TMs$ that cannot write on the portion of the tape containing the input string recognize only regular languages. Theory of Computation michael-sipser theory-of-computation turing-machine recursive-and-recursively-enumerable-languages proof + – admin asked Oct 15, 2019 admin 159 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.