Skip to main content
Log in

A note on multihead automata and context-sensitive languages

  • Published:
Acta Informatica Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Hartmanis, J.: On non-determinacy in simple computing devices. Acta Informatica 1, 336–344 (1972)

    Google Scholar 

  2. Hopcroft, J. E., Ullman, J. D.: Formal languages and their relation to automata. Reading (Mass.): Addison-Wesley 1969

    Google Scholar 

  3. Savitch, W. J.: Relationships between nondeterministic and deterministic tape complexities. J. Computer and System Sciences 4, 177–192 (1970)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This research was supported by NSF grant GJ-27278.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00289080

Keywords

Navigation