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...
The expanding cellular automata (XCA) variant of cellular automata is investigated and characterized...
AbstractIn this paper we study combinatorial constructions which lead to one-sided invertible cellul...
Part 2: Regular PapersInternational audienceWe discuss cellular automata over arbitrary finitely gen...
International audienceWe introduce the property of pre-expansivity for cellular automata (CA): it is...
We introduce the notion of pre expansivity for cellular automata (CA): it is the property of being p...
AbstractWe establish a connection between the theory of Lyapunov exponents and the properties of exp...
We provide an easily checkable algebraic characterization of positive expansivity for Additive Cellu...
International audienceIn this paper we study the dynamics of D-dimensional cellular automata (CA) by...
Part 1: Invited PapersInternational audienceA large part of the study of cellular automata dynamics ...
International audienceWe prove that there do not exist positively expansive cellular automata define...
One of the first and most famous results of cellular automata theory, Moore’s Garden-of-Eden t...
A dynamical system consists of a space of all possible world states and a transformation of said spa...
An Automata Network is a map where Q is a finite alphabet. It can be viewed as a network of n entit...
We discuss cellular automata over arbitrary finitely generated groups. Wecall a cellular automaton p...
We investigate decidable properties for regular cellular automata. In particular, we show that regu...
The expanding cellular automata (XCA) variant of cellular automata is investigated and characterized...
AbstractIn this paper we study combinatorial constructions which lead to one-sided invertible cellul...
Part 2: Regular PapersInternational audienceWe discuss cellular automata over arbitrary finitely gen...
International audienceWe introduce the property of pre-expansivity for cellular automata (CA): it is...
We introduce the notion of pre expansivity for cellular automata (CA): it is the property of being p...
AbstractWe establish a connection between the theory of Lyapunov exponents and the properties of exp...
We provide an easily checkable algebraic characterization of positive expansivity for Additive Cellu...
International audienceIn this paper we study the dynamics of D-dimensional cellular automata (CA) by...
Part 1: Invited PapersInternational audienceA large part of the study of cellular automata dynamics ...
International audienceWe prove that there do not exist positively expansive cellular automata define...
One of the first and most famous results of cellular automata theory, Moore’s Garden-of-Eden t...
A dynamical system consists of a space of all possible world states and a transformation of said spa...
An Automata Network is a map where Q is a finite alphabet. It can be viewed as a network of n entit...
We discuss cellular automata over arbitrary finitely generated groups. Wecall a cellular automaton p...
We investigate decidable properties for regular cellular automata. In particular, we show that regu...
The expanding cellular automata (XCA) variant of cellular automata is investigated and characterized...
AbstractIn this paper we study combinatorial constructions which lead to one-sided invertible cellul...
Part 2: Regular PapersInternational audienceWe discuss cellular automata over arbitrary finitely gen...