Skip to main content
SpringerLink
Log in

Inherently nonplanar automata

  • Published:
Acta Informatica Aims and scope Submit manuscript

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.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Salomaa, A.: Theory of automata. New York: Pergamon-Press 1969

    MATH  Google Scholar 

  2. Harary, F.: Graph theory. Reading (Mass.): Addison-Wesley 1971

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Yale University, 06520, New Haven, Connecticut, USA

    Ronald V. Book

  2. Computer Sciences Department, IBM Thomas J. Watson Research Center, 10598, Yorktown Heights, New York, USA

    Ashok K. Chandra

Authors
  1. Ronald V. Book
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ashok K. Chandra
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The work of this author was supported in part by the National Science Foundation under Grants GJ-30409 and DCR-75-15945.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Book, R.V., Chandra, A.K. Inherently nonplanar automata. Acta Informatica 6, 89–94 (1976). https://doi.org/10.1007/BF00263745

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation