Every language accepted by a k-tape TM is _____ by a single-tape TM.
(a) accepted
(b) not accepted
(c) generated
(d) not generated
The question was posed to me in examination.
My question is based upon Equivalence of One-Tape and Multitape TM’s in chapter Introduction to Turing Machines of Automata Theory