Abstract
We study cellular automata (CA) behavior in Besicovitch topology. We solve an open problem about the existence of transitive CA. The proof of this result has some interest in its own since it is obtained by using Kolmogorov complexity. At our knowledge it if the first result on discrete dynamical systems obtained using Kolmogorov complexity. We also prove that every CA (in Besicovitch topology) either has a unique fixed point or a countable set of periodic points. This result underlines that CA have a great degree of stability and may be considered a further step towards the understanding of CA periodic behavior.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Blanchard, F., Formenti, E., Kůrka, P.: Cellular automata in the Cantor, Besicovitch and Weyl topological spaces. Complex Systems 11, 107–123 (1999)
Blanchard, F., Tisseur, P.: Some properties of cellular automata with equicontinuity points. Annales de l’Instute Henri Poincaré 36(5), 562–582 (2000)
Calude, C., Hertling, P., Jürgensen, H., Weihrauch, K.: Randomness on full shift spaces. Chaos, Solitons & Fractals 1, 1–13 (2000)
Cattaneo, G., Formenti, E., Margara, L., Mazoyer, J.: A Shift-invariant Metric on S ZZ Inducing a Non-trivial Topology. In: Privara, I., Ružička, P. (eds.) MFCS 1997. LNCS, vol. 1295. Springer, Heidelberg (1997)
Cervelle, J., Durand, B., Formenti, E.: Algorithmic information theory and cellular automata dynamics. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol. 2136, pp. 248–259. Springer, Heidelberg (2001)
Delorme, M., Formenti, E., Mazoyer, J.: Open problems on cellular automata (2002) (submitted)
Devaney, R.L.: An introduction to chaotic dynamical systems. Addison-Wesley, Reading (1989)
Dubacq, J.-C., Durand, B., Formenti, E.: Kolmogorov complexity and cellular automata classification. Theoretical Computer Science 259(1–2), 271–285 (2001)
Durand, B.: Global properties of cellular automata. In: Goles, E., Martinez, S. (eds.) Cellular Automata and Complex Systems. Kluwer, Dordrecht (1998)
Formenti, E.: On the sensitivity of cellular automata in Besicovitch spaces. Theoretical Computer Science 301(1–3), 341–354 (2003)
Li, M., Vitányi, P.: An Introduction to Kolmogorov complexity and its applications, 2nd edn. Springer, Berlin (1997)
Manzini, G.: Characterization of sensitive linear cellular automata with respect to the counting distance. In: Brim, L., Gruska, J., Zlatuška, J. (eds.) MFCS 1998. LNCS, vol. 1450, pp. 825–833. Springer, Heidelberg (1998)
Martin, B.: Damage spreading and μ-sensitivity in cellular automata. Ergodic theory & dynammical systems (2002) (to appear)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Blanchard, F., Cervelle, J., Formenti, E. (2003). Periodicity and Transitivity for Cellular Automata in Besicovitch Topologies. In: Rovan, B., Vojtáš, P. (eds) Mathematical Foundations of Computer Science 2003. MFCS 2003. Lecture Notes in Computer Science, vol 2747. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45138-9_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-45138-9_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40671-6
Online ISBN: 978-3-540-45138-9
eBook Packages: Springer Book Archive