We consider one-dimensional cellular automata, i.e. the maps T : P(Z) --> P(Z) (P is a finite wt with more than one element) which are given by (Tx)i = = F(x(i + l), ..., x(i + r)), x = (x(i)) (is-an-element-of Z) is-an-element-of P(Z) for some integers l less-than-or-equal-to r and a mapping F : P(r - l + 1) --> P. We prove that if F is right- (left-) permutative (in Hedlund's terminology) and 0 less-than-or-equal-to l 0 and T is surjective, then the natural extension of the system (P(Z), B, mu, T) is a K-automorphism. We also prove that the shift Z2-action on a two-dimensional subshift of finite type canonically associated with the cellular automaton T is mixing, if F is both right and left permutative. These results answer some question...
Part 2: Regular PapersInternational audienceWe discuss cellular automata over arbitrary finitely gen...
International audienceWe prove that there do not exist positively expansive cellular automata define...
AbstractA subclass of cellular automata called linear cellular automata over Zm is studied. Criteria...
AbstractIn this paper, we introduce a set E(f∞) which consists of all points r ϵ Z2 such that the co...
AbstractWe prove that the natural extension of the (measure preserving) map T:SZ → SZ (1 < ¦S¦ < ∞) ...
In this thesis we study measurable and topological dynamics of certain classes of cellular automata...
We study the dynamical behavior of D-dimensional linear cellular automata over Zm. We provide an eas...
none4siWe study the dynamical behavior of additive D-dimensional ( cellular automata where the alp...
none4siWe prove that important properties describing complex behaviours as ergodicity, chaos, topolo...
AbstractWe study the dynamical behavior of D-dimensional linear cellular automata over Zm. We provid...
We study the dynamical behavior of D-dimensional (D ≥ 1) additive cellular automata where the alphab...
Abstract The main goal of this note is to classify by conjugacy classes the collection of r-cellular...
We study cellular automata as discrete dynamical systems and in particular investigate under which c...
We consider two relatively natural topologizations of the set of all cellular automata on a fixed al...
AbstractIf A is a finite alphabet and Γ is a finitely generated amenable group, Ceccherini-Silberste...
Part 2: Regular PapersInternational audienceWe discuss cellular automata over arbitrary finitely gen...
International audienceWe prove that there do not exist positively expansive cellular automata define...
AbstractA subclass of cellular automata called linear cellular automata over Zm is studied. Criteria...
AbstractIn this paper, we introduce a set E(f∞) which consists of all points r ϵ Z2 such that the co...
AbstractWe prove that the natural extension of the (measure preserving) map T:SZ → SZ (1 < ¦S¦ < ∞) ...
In this thesis we study measurable and topological dynamics of certain classes of cellular automata...
We study the dynamical behavior of D-dimensional linear cellular automata over Zm. We provide an eas...
none4siWe study the dynamical behavior of additive D-dimensional ( cellular automata where the alp...
none4siWe prove that important properties describing complex behaviours as ergodicity, chaos, topolo...
AbstractWe study the dynamical behavior of D-dimensional linear cellular automata over Zm. We provid...
We study the dynamical behavior of D-dimensional (D ≥ 1) additive cellular automata where the alphab...
Abstract The main goal of this note is to classify by conjugacy classes the collection of r-cellular...
We study cellular automata as discrete dynamical systems and in particular investigate under which c...
We consider two relatively natural topologizations of the set of all cellular automata on a fixed al...
AbstractIf A is a finite alphabet and Γ is a finitely generated amenable group, Ceccherini-Silberste...
Part 2: Regular PapersInternational audienceWe discuss cellular automata over arbitrary finitely gen...
International audienceWe prove that there do not exist positively expansive cellular automata define...
AbstractA subclass of cellular automata called linear cellular automata over Zm is studied. Criteria...