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.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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).
F.Blanchard, A.Maas: Propriétés ergodiques d'une certaine classe d'automates cellulaires expansive. Manuscript 1994.
K.Culik II, L.P.Hurd, S.Yu: Computation theoretic aspects of cellular automata. Physica D 45, 357â378 (1990).
R.L.Devaney: An Introduction to Chaotic Dynamical Systems. Addison-Wesley, Redwood City 1989.
R.Gilman: Periodic behaviour of linear automata, in: Dynamical Systems (J.C.Alexander, ed.), Springer Lecture Notes in Mathematics 1342, Springer-Verlag, Berlin 1988.
G.A.Hedlund: Transformations commuting with the shift, in: Topological Dynamics (J.Auslander and W.G.Gottschalk, eds.) Benjamin, New York 1969.
J.G.Hocking: Topology. Dover Publications, New York 1988.
P.Kůrka: Regular unimodal systems and factors of finite automata, to appear in Theoretical Computer Science.
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.
M.Mitchell, P.T.Hraber, J.P.Crutchfield: Revisiting the edge of chaos: evolving cellular automata to perform computations. Complex Systems, in press.
Ch.Moore: Unpredictability and undecidability in dynamical systems. Physical Review Letters 64(20), 2354â2357, (1990).
A.R.Smith: Simple computation-universal cellular spaces. J. ACM 18, 339â353 (1971).
B.Weiss: Subshifts of finite type and sofic systems, Monatsh. Math. 77, 462â474, 1973.
S.Wolfram: Theory and Applications of Cellular Automata. World Scientific, Singapore, 1986.
Author information
Authors and Affiliations
Editor information
Rights 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