Abstract
We apply the definition of chaos given by Devaney for discrete time dynamical systems to the case of elementary cellular automata, i.e., 1-dimensional binary cellular automata with radius 1. A discrete time dynamical system is chaotic according to the Devaney's definition of chaos if it is topologically transitive, is sensitive to initial conditions, and has dense periodic orbits. We enucleate an easy-to-check property of the local rule on which a cellular automaton is based which is a necessary condition for chaotic behavior. We prove that this property is also sufficient for a large class of elementary cellular automata. The main contribution of this paper is the formal proof of chaoticity for many non additive elementary cellular automata. Finally, we prove that the above mentioned property does not remain a necessary condition for chaoticity in the case of non elementary cellular automata.
Partially supported by MURST 40% and 60% funds.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
D. Assaf, IV and W. A. Coppel, Definition of Chaos. The American Mathematical Monthly, 865, 1992.
J. Banks, J. Brooks, G. Cairns, G. Davis, and P. Stacey, On the Devaney's Definition of Chaos. The American Mathematical Monthly, 332–334, 1992.
K. Culik, L. P. Hurd, and S. Yu, Computation theoretic aspects of CA. Physica D 45, 357–378, 1990.
K.Culik and S. Yu, Undecidability of CA Classification Schemes. Complex Systems 2(2), 177–190, 1988.
B. Codenotti and L. Margara, Transitive Cellular Automata are Sensitive. The American Mathematical Monthly, Vol. 103, 58–62, 1996.
R. L. Devaney, An Introduction to Chaotic Dynamical Systems. Addison Wesley, 1989.
H. A. Gutowitz, A Hierarchycal Classification of Cellular Automata. Physica D 45, 136–156, 1990.
G. A. Hedlund, Endomorphism and Automorphism of the Shift Dynamical System. Mathematical System Theory 3(4), 320–375, 1970.
C. Knudsen, Aspects of Noninvertible Dynamics and Chaos, Ph.D. Thesis, 1994.
C. Knudsen, Chaos Without Nonperiodicity, The American Mathematical Monthly, 563–565, 1994.
P. Favati, G. Lotti and L. Margara, Additive cellular Automata are chaotic According to Devaney's Definition of Chaos. To appear on Theoretical Computer Science.
K. Sutner, Classifying Circular Cellular Automata. Physica D 45, 386–395, 1990.
M. Vellekoop and R. Berglund, On Intervals, Transitivity=Chaos. The American Mathematical Monthly, 353–355, 1994.
S. Wolfram, Theory and Application of Cellular Automata. Word Scientific Publishing Co., Singapore, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cattaneo, G., Finelli, M., Margara, L. (1997). Topological chaos for elementary cellular automata. In: Bongiovanni, G., Bovet, D.P., Di Battista, G. (eds) Algorithms and Complexity. CIAC 1997. Lecture Notes in Computer Science, vol 1203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62592-5_76
Download citation
DOI: https://doi.org/10.1007/3-540-62592-5_76
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62592-6
Online ISBN: 978-3-540-68323-0
eBook Packages: Springer Book Archive