Add to ORKGWe provide an easily checkable algebraic characterization of positive expansivity for Additive Cellular Automata over a finite abelian group. First of all, an easily checkable characterization of positive expansivity is provided for the non trivial subclass of Linear Cellular Automata over the alphabet $(\Z/m\Z)^n$. Then, we show how it can be exploited to decide positive expansivity for the whole class of Additive Cellular Automata over a finite abelian group.Comment: 12 page
ABSTRACT. A class of additive cellular automata (ACA) on a finite group is defined by an index-group...
AbstractWe show that, for a large and important class of reversible, one-dimensional cellular automa...
none4siWe provide an efficiently computable characterization of two important properties describing ...
This paper proves the decidability of several important properties of additive cellular automata ove...
Let $G$ be a group and $A$ a set equipped with a collection of finitary operations. We study cellula...
none4siAdditive cellular automata over a finite abelian group are a wide class of cellular automata ...
We introduce the notion of pre expansivity for cellular automata (CA): it is the property of being p...
We study the dynamical behavior of D-dimensional (D ≥ 1) additive cellular automata where the alphab...
International audienceWe introduce the property of pre-expansivity for cellular automata (CA): it is...
We study the dynamical behavior of D-dimensional (D >= 1) additive cellular automata where the alpha...
none4siWe study the dynamical behavior of additive D-dimensional ( cellular automata where the alp...
For a group $G$ and a set $A$, let $\text{End}(A^G)$ be the monoid of all cellular automata over $A^...
We discuss cellular automata over arbitrary finitely generated groups. Wecall a cellular automaton p...
Let $G$ be a group and let $A$ be a finite set with at least two elements. A cellular automaton (CA)...
A class of dynamical systems associated to rings of S-integers in rational function fields is descri...
ABSTRACT. A class of additive cellular automata (ACA) on a finite group is defined by an index-group...
AbstractWe show that, for a large and important class of reversible, one-dimensional cellular automa...
none4siWe provide an efficiently computable characterization of two important properties describing ...
This paper proves the decidability of several important properties of additive cellular automata ove...
Let $G$ be a group and $A$ a set equipped with a collection of finitary operations. We study cellula...
none4siAdditive cellular automata over a finite abelian group are a wide class of cellular automata ...
We introduce the notion of pre expansivity for cellular automata (CA): it is the property of being p...
We study the dynamical behavior of D-dimensional (D ≥ 1) additive cellular automata where the alphab...
International audienceWe introduce the property of pre-expansivity for cellular automata (CA): it is...
We study the dynamical behavior of D-dimensional (D >= 1) additive cellular automata where the alpha...
none4siWe study the dynamical behavior of additive D-dimensional ( cellular automata where the alp...
For a group $G$ and a set $A$, let $\text{End}(A^G)$ be the monoid of all cellular automata over $A^...
We discuss cellular automata over arbitrary finitely generated groups. Wecall a cellular automaton p...
Let $G$ be a group and let $A$ be a finite set with at least two elements. A cellular automaton (CA)...
A class of dynamical systems associated to rings of S-integers in rational function fields is descri...
ABSTRACT. A class of additive cellular automata (ACA) on a finite group is defined by an index-group...
AbstractWe show that, for a large and important class of reversible, one-dimensional cellular automa...
none4siWe provide an efficiently computable characterization of two important properties describing ...