Periodic Orbits and Dynamical Complexity in Cellular Automata

Abstract : We investigate the relationships between dynamical complexity and the set of periodic configurations of surjective Cellular Automata. We focus on the set of strictly temporally periodic configurations, i.e., the set of those configurations which are temporally but not spatially periodic for a given surjective automaton. The cardinality of this set turns out to be inversely related to the dynamical complexity of the cellular automaton. In particular, we show that for surjective Cellular Automata, the set of strictly temporally periodic configurations has strictly positive measure if and only if the cellular automaton is equicontinuous. Furthermore, we show that the set of strictly temporally periodic configurations is dense for almost equicontinuous surjective cellular automata, while it is empty for the positively expansive ones. In the class of additive cellular automata, the set of strictly temporally periodic points can be either dense or empty. The latter happens if and only if the cellular automaton is topologically transitive. This is not true for general transitive Cellular Automata, where the set of of strictly temporally periodic points can be non-empty and non-dense.
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01312658
Contributeur : Enrico Formenti <>
Soumis le : dimanche 8 mai 2016 - 09:41:27
Dernière modification le : lundi 9 mai 2016 - 01:04:08

Identifiants

Collections

Citation

Alberto Dennunzio, Pietro Di Lena, Enrico Formenti, Luciano Margara. Periodic Orbits and Dynamical Complexity in Cellular Automata. Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2013, Cellular Automata and Models of Computation, 126 (2-3), pp.183-199. <http://content.iospress.com/articles/fundamenta-informaticae/fi126-2-3-04>. <10.3233/FI-2013-877>. <hal-01312658>

Partager

Métriques

Consultations de la notice

102