Skip to main content
SpringerLink
Log in

Automaten in planaren Graphen

Automata in planar graphs

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

For any finite set of automata there is a planar graph which the automata together cannot search.

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

Literatur

  1. Blum, M., Kozen, D.: On the power of the compass. 19th IEEE FOCS 1978

  2. Blum, M, Sakoda, W.: On the capability of finite automata in 2 and 3 dimensional space. Proc. 17th IEEE Conf., 147–161, 1977

  3. Budach, L.: Automata and labyrinths. Unveröffentlichtes Manuskript, 1974

  4. Müller, H.: Endliche Automaten und Labyrinthe. EIK 7, 4, 261–274 (1971)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Abteilung für Informatik, Universität Dortmund, D-4600, Dortmund, Germany (Fed. Rep.)

    H. A. Rollik

Authors
  1. H. A. Rollik
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rollik, H.A. Automaten in planaren Graphen. Acta Informatica 13, 287–298 (1980). https://doi.org/10.1007/BF00288647

Download citation

  • Received:

  • Issue Date:

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

Search

Navigation