Skip to main content
SpringerLink
Log in

On Cellular Automata with a Finite Number of State Changes

  • Chapter
Parallel Processes and Related Automata / Parallele Prozesse und damit zusammenhängende Automaten

Part of the book series: Computing Supplementum ((COMPUTING,volume 3))

Abstract

On Cellular Automata with a Finite Number of State Changes. The number of state changes is introduced as a complexity measure for the recognition of languages in cellular automata. The relation of the simplest class — i.e. the one with a constant number of changes per single automaton — to the Chomsky hierarchy is investigated and a comparison with sequential tape complexity is made.

Zusammenfassung

Über Zellularautomaten mit beschränkter Änderungskompiexität. Die Anzahl der Zustandsänderungen jedes Einzelautomaten wird als Maß für die Komplexität bei der Erkennung von Sprachen in Zellularautomaten eingeführt. Die einfachste dadurch definierte Klasse von Sprachen, die mit konstanter Änderungszahl pro Einzelautomat, wird bezüglich ihrer Lage in der Chomsky-Hierarchie untersucht, und es wird eine Verbindung zur sequentiellen Bandkomplexität hergestellt.

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

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Vollmar, R.: Algorithmen in Zellularautomaten. Stuttgart: Teubner 1979.

    MATH  Google Scholar 

  2. Nishio, H.: Heuristic use of image processing technique for theoretical studies of automata. In: Frontiers of pattern recognition (Watanabe, S., ed.), pp. 373–389. New York: Academic Press 1972.

    Google Scholar 

  3. Hennie, F. C.: One-tape, off-line Turing machine computations. Inform. Control 8, 553–578 (1965).

    Article  MathSciNet  Google Scholar 

  4. Feller, W.: An introduction to probability theory and its applications, Vol. I, 3rd ed. (revised printing), p. 38. New York-Sydney: Wiley 1968.

    MATH  Google Scholar 

  5. Greibach, S. A.: Visits, crosses, and reversals for non-deterministic off-line machines. Inform. Control 36, 174–216 (1978).

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lehrstuhl C für Informatik, Technische Universität Braunschweig, Gaussstrasse 11, D-3300, Braunschweig, Federal Republic of Germany

    Prof. Dr.-Ing. R. Vollmar

Authors
  1. Prof. Dr.-Ing. R. Vollmar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Universität Stuttgart, Federal Republic of Germany

    Walter Knödel

  2. Institut für Mathematische Maschinen und Datenverarbeitung, Universität Erlangen-Nürnberg, Federal Republic of Germany

    Hans Jürgen Schneider

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag

About this chapter

Cite this chapter

Vollmar, R. (1981). On Cellular Automata with a Finite Number of State Changes. In: Knödel, W., Schneider, H.J. (eds) Parallel Processes and Related Automata / Parallele Prozesse und damit zusammenhängende Automaten. Computing Supplementum, vol 3. Springer, Vienna. https://doi.org/10.1007/978-3-7091-8596-4_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-8596-4_13

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-81606-6

  • Online ISBN: 978-3-7091-8596-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation