Subshift attractors of cellular automata

Abstract : A subshift attractor is a two-sided subshift which is an attractor of a cellular automaton. We prove that each subshift attractor is chain-mixing, contains a configuration which is both F-periodic and $\sigma$-periodic and the complement of its language is recursively enumerable. We prove that a subshift of finite type is an attractor of a cellular automaton iff it is mixing. We identify a class of chain-mixing sofic subshifts which are not subshift attractors. We construct a cellular automaton whose maximal attractor is a non-sofic mixing subshift, answering a question raised in Maass. We show that a cellular automaton is surjective on its small quasi-attractor which is the non-empty intersection of all subshift attractors of all $F^q\sigma^p$, where $q>0$ and $p\in Z$.
Liste complète des métadonnées
Contributeur : Enrico Formenti <>
Soumis le : vendredi 22 août 2008 - 18:06:26
Dernière modification le : vendredi 13 novembre 2009 - 11:46:21


  • HAL Id : hal-00311968, version 1



Enrico Formenti, Petr Kurka. Subshift attractors of cellular automata. Nonlinearity, IOP Publishing, 2007, 20, pp.105-117. 〈hal-00311968〉



Consultations de la notice