Skip to main content
SpringerLink
Log in

A comparison of finite and cellular automata

  • Contributions
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1994 (MFCS 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 841))

  • 165 Accesses

Abstract

We conceive finite and cellular automata as dynamical systems on zero-dimensional spaces and show that they are incomparable in the sense of factorization. Next we study the complexity of languages generated by zero-dimensional systems on clopen partitions of the state space. While finite automata generate only regular languages, cellular automata generate non-deterministic polynomial languages which may be non-regular.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B.Balcar, P.Simon: Appendix on general topology. Handbook of Boolean Algebras (J.D.Monk and R.Bonnet, eds.), Elsevier Science Publishers B.V., 1241 (1989).

    Google Scholar 

  2. F.Blanchard, A.Maas: Propriétés ergodiques d'une certaine classe d'automates cellulaires expansive. Manuscript 1994.

    Google Scholar 

  3. K.Culik II, L.P.Hurd, S.Yu: Computation theoretic aspects of cellular automata. Physica D 45, 357–378 (1990).

    Google Scholar 

  4. R.L.Devaney: An Introduction to Chaotic Dynamical Systems. Addison-Wesley, Redwood City 1989.

    Google Scholar 

  5. R.Gilman: Periodic behaviour of linear automata, in: Dynamical Systems (J.C.Alexander, ed.), Springer Lecture Notes in Mathematics 1342, Springer-Verlag, Berlin 1988.

    Google Scholar 

  6. G.A.Hedlund: Transformations commuting with the shift, in: Topological Dynamics (J.Auslander and W.G.Gottschalk, eds.) Benjamin, New York 1969.

    Google Scholar 

  7. J.G.Hocking: Topology. Dover Publications, New York 1988.

    Google Scholar 

  8. P.Kůrka: Regular unimodal systems and factors of finite automata, to appear in Theoretical Computer Science.

    Google Scholar 

  9. P.Kůrka: Simplicity criteria for dynamical systems, to appear in the Proceedings of the conference ”Analysis of Dynamical and Cognitive Systems”, Stockholm, August 9–13, 1993.

    Google Scholar 

  10. M.Mitchell, P.T.Hraber, J.P.Crutchfield: Revisiting the edge of chaos: evolving cellular automata to perform computations. Complex Systems, in press.

    Google Scholar 

  11. Ch.Moore: Unpredictability and undecidability in dynamical systems. Physical Review Letters 64(20), 2354–2357, (1990).

    Google Scholar 

  12. A.R.Smith: Simple computation-universal cellular spaces. J. ACM 18, 339–353 (1971).

    Google Scholar 

  13. B.Weiss: Subshifts of finite type and sofic systems, Monatsh. Math. 77, 462–474, 1973.

    Google Scholar 

  14. S.Wolfram: Theory and Applications of Cellular Automata. World Scientific, Singapore, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Physics, Charles University in Prague, Malostranské náměstí 25, 118 00, Praha 1, Czechia

    Petr Kůrka

Authors
  1. Petr Kůrka
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Igor Prívara Branislav Rovan Peter Ruzička

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kůrka, P. (1994). A comparison of finite and cellular automata. In: Prívara, I., Rovan, B., Ruzička, P. (eds) Mathematical Foundations of Computer Science 1994. MFCS 1994. Lecture Notes in Computer Science, vol 841. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58338-6_95

Download citation

  • DOI: https://doi.org/10.1007/3-540-58338-6_95

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58338-7

  • Online ISBN: 978-3-540-48663-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation