International audienceWe introduce the property of pre-expansivity for cellular automata (CA): it is the property of being expansive on asymptotic pairs of configurations (i.e. configurations that differ in only finitely many positions). Pre-expansivity therefore lies between expansivity and pre-injectivity, two important notions of CA theory. We show that there exist one-dimensional positively pre-expansive CAs which are not positively expansive and they can be chosen reversible (while positive expansivity is impossible for reversible CAs). We show however that no bi-dimensional CA which is linear over an Abelian group can be pre-expansive. We also consider the finer notion of k-expansivity (expansivity over pairs of configurations with ex...
open4siThis paper proves the decidability of several important properties of additive cellular autom...
International audienceWe prove that surjective ultimately right-expansive cellular automata over ful...
We prove that surjective ultimately right-expansive cellular automata over full shifts are chain-tra...
International audienceWe introduce the notion of pre-expansivity for cellular automata (CA): it is t...
International audienceWe introduce the property of pre-expansivity for cellular automata (CA): it is...
AbstractWe establish a connection between the theory of Lyapunov exponents and the properties of exp...
We discuss cellular automata over arbitrary finitely generated groups. Wecall a cellular automaton p...
Part 2: Regular PapersInternational audienceWe discuss cellular automata over arbitrary finitely gen...
International audienceIn this paper we study the dynamics of D-dimensional cellular automata (CA) by...
International audienceWe prove that there do not exist positively expansive cellular automata define...
Part 1: Invited PapersInternational audienceA large part of the study of cellular automata dynamics ...
We provide an easily checkable algebraic characterization of positive expansivity for Additive Cellu...
We investigate decidable properties for regular cellular automata. In particular, we show that regul...
Part 2: Regular PapersInternational audienceReversibility is the property of very special cellular a...
AbstractIn this paper we study combinatorial constructions which lead to one-sided invertible cellul...
open4siThis paper proves the decidability of several important properties of additive cellular autom...
International audienceWe prove that surjective ultimately right-expansive cellular automata over ful...
We prove that surjective ultimately right-expansive cellular automata over full shifts are chain-tra...
International audienceWe introduce the notion of pre-expansivity for cellular automata (CA): it is t...
International audienceWe introduce the property of pre-expansivity for cellular automata (CA): it is...
AbstractWe establish a connection between the theory of Lyapunov exponents and the properties of exp...
We discuss cellular automata over arbitrary finitely generated groups. Wecall a cellular automaton p...
Part 2: Regular PapersInternational audienceWe discuss cellular automata over arbitrary finitely gen...
International audienceIn this paper we study the dynamics of D-dimensional cellular automata (CA) by...
International audienceWe prove that there do not exist positively expansive cellular automata define...
Part 1: Invited PapersInternational audienceA large part of the study of cellular automata dynamics ...
We provide an easily checkable algebraic characterization of positive expansivity for Additive Cellu...
We investigate decidable properties for regular cellular automata. In particular, we show that regul...
Part 2: Regular PapersInternational audienceReversibility is the property of very special cellular a...
AbstractIn this paper we study combinatorial constructions which lead to one-sided invertible cellul...
open4siThis paper proves the decidability of several important properties of additive cellular autom...
International audienceWe prove that surjective ultimately right-expansive cellular automata over ful...
We prove that surjective ultimately right-expansive cellular automata over full shifts are chain-tra...