A note on multihead automata and context-sensitive languages

SummaryIn this note we show that the following two statements are equivalent: (1) Any language over a one-letter alphabet, which is accepted by some nondeterministic multihead automaton can also be accepted by some deterministic multihead automaton. (2) Deterministic and nondeterministic context-sensitive languages are the same.

[1]  Walter J. Savitch,et al.  Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[2]  Jeffrey D. Ullman,et al.  Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

[3]  Juris Hartmanis.  On non-determinancy in simple computing devices , 2004, Acta Informatica.