Summary
In 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.
Similar content being viewed by others
References
Hartmanis, J.: On non-determinacy in simple computing devices. Acta Informatica 1, 336–344 (1972)
Hopcroft, J. E., Ullman, J. D.: Formal languages and their relation to automata. Reading (Mass.): Addison-Wesley 1969
Savitch, W. J.: Relationships between nondeterministic and deterministic tape complexities. J. Computer and System Sciences 4, 177–192 (1970)
Author information
Authors and Affiliations
Additional information
This research was supported by NSF grant GJ-27278.
Rights and permissions
About this article
Cite this article
Savitch, W.J. A note on multihead automata and context-sensitive languages. Acta Informatica 2, 249–252 (1973). https://doi.org/10.1007/BF00289080
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00289080