About a low complexity class of Cellular Automata - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Comptes rendus de l'Académie des sciences. Série I, Mathématique Année : 2008

About a low complexity class of Cellular Automata

Résumé

Extending to all probability measures the notion of m-equicontinuous cellular automata introduced for Bernoulli measures by Gilman, we show that the entropy is null if m is an invariant measure and that the sequence of image measures of a shift ergodic measure by iterations of such automata converges in Cesaro mean to an invariant measure mc. Moreover this cellular automaton is still mc-equicontinuous and the set of periodic points is dense in the topological support of the measure mc. The last property is also true when m is invariant and shift ergodic.
Fichier principal
Vignette du fichier
low-complexity-class-of-ca2.pdf (107.67 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00711870 , version 1 (26-06-2012)
hal-00711870 , version 2 (26-06-2012)

Identifiants

Citer

Pierre Tisseur. About a low complexity class of Cellular Automata. Comptes rendus de l'Académie des sciences. Série I, Mathématique, 2008, 17-18 (346), pp.995-998. ⟨hal-00711870v2⟩

Collections

TDS-MACS
47 Consultations
79 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More