Advertisement

Acta Informatica

, Volume 6, Issue 1, pp 89–94 | Cite as

Inherently nonplanar automata

  • Ronald V. Book
  • Ashok K. Chandra
Article

Summary

It is shown that for every finite-state automaton there exists an equivalent nondeterministic automaton with a planar state graph. However there exist finite-state automata with no equivalent deterministic automaton with a planar state graph.

Keywords

Information System Operating System Data Structure Communication Network Information Theory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Salomaa, A.: Theory of automata. New York: Pergamon-Press 1969zbMATHGoogle Scholar
  2. 2.
    Harary, F.: Graph theory. Reading (Mass.): Addison-Wesley 1971zbMATHGoogle Scholar

Copyright information

© Springer-Verlag 1976

Authors and Affiliations

  • Ronald V. Book
    • 1
  • Ashok K. Chandra
    • 2
  1. 1.Department of Computer ScienceYale UniversityNew HavenUSA
  2. 2.Computer Sciences DepartmentIBM Thomas J. Watson Research CenterYorktown HeightsUSA

Personalised recommendations