AbstractWhen G is an arbitrary group and V is a finite-dimensional vector space, it is known that every bijective linear cellular automaton τ:VG→VG is reversible and that the image of every linear cellular automaton τ:VG→VG is closed in VG for the prodiscrete topology. In this paper, we present a new proof of these two results which is based on the Mittag-Leffler lemma for projective sequences of sets. We also show that if G is a non-periodic group and V is an infinite-dimensional vector space, then there exist a linear cellular automaton τ1:VG→VG which is bijective but not reversible and a linear cellular automaton τ2:VG→VG whose image is not closed in VG for the prodiscrete topology
The problem of deciding if a given cellular automaton (CA) is reversible (or, equivalently, if its g...
AbstractLet A be a set and let G be a group, and equip AG with its prodiscrete uniform structure. Le...
Let $G$ be a group and let $A$ be a finite set with at least two elements. A cellular automaton (CA)...
AbstractWhen G is an arbitrary group and V is a finite-dimensional vector space, it is known that ev...
Part 2: Regular PapersInternational audienceWe discuss cellular automata over arbitrary finitely gen...
We consider two relatively natural topologizations of the set of all cellular automata on a fixed al...
open4siThis paper proves the decidability of several important properties of additive cellular autom...
We consider two relatively natural topologizations of the set of all cellular automata on a fixed al...
Abstract Linear cellular automata have a canonical representation in terms of labeled de Bruijn grap...
We discuss cellular automata over arbitrary finitely generated groups. Wecall a cellular automaton p...
We study the dynamical behavior of D-dimensional linear cellular automata over Zm. We provide an eas...
AbstractWe study two dynamical properties of linear D-dimensional cellular automata over Zm namely, ...
AbstractWe study the dynamical behavior of D-dimensional linear cellular automata over Zm. We provid...
Let G be a finite group and A a finite set. A cellular automaton is a transformation of the configur...
Discrete dynamical systems such as cellular automata are of increasing interest to scientists in a v...
The problem of deciding if a given cellular automaton (CA) is reversible (or, equivalently, if its g...
AbstractLet A be a set and let G be a group, and equip AG with its prodiscrete uniform structure. Le...
Let $G$ be a group and let $A$ be a finite set with at least two elements. A cellular automaton (CA)...
AbstractWhen G is an arbitrary group and V is a finite-dimensional vector space, it is known that ev...
Part 2: Regular PapersInternational audienceWe discuss cellular automata over arbitrary finitely gen...
We consider two relatively natural topologizations of the set of all cellular automata on a fixed al...
open4siThis paper proves the decidability of several important properties of additive cellular autom...
We consider two relatively natural topologizations of the set of all cellular automata on a fixed al...
Abstract Linear cellular automata have a canonical representation in terms of labeled de Bruijn grap...
We discuss cellular automata over arbitrary finitely generated groups. Wecall a cellular automaton p...
We study the dynamical behavior of D-dimensional linear cellular automata over Zm. We provide an eas...
AbstractWe study two dynamical properties of linear D-dimensional cellular automata over Zm namely, ...
AbstractWe study the dynamical behavior of D-dimensional linear cellular automata over Zm. We provid...
Let G be a finite group and A a finite set. A cellular automaton is a transformation of the configur...
Discrete dynamical systems such as cellular automata are of increasing interest to scientists in a v...
The problem of deciding if a given cellular automaton (CA) is reversible (or, equivalently, if its g...
AbstractLet A be a set and let G be a group, and equip AG with its prodiscrete uniform structure. Le...
Let $G$ be a group and let $A$ be a finite set with at least two elements. A cellular automaton (CA)...