We prove that topologically isomorphic linear cellular automaton shifts are algebraically isomorphic. Using this, we show that two distinct such shifts cannot be isomorphic. We conclude that the automorphism group of a linear cellular automaton shift is a finitely generated abelian group
Let $G$ be a group and let $A$ be a finite set with at least two elements. A cellular automaton (CA)...
Abstract. Let M = ZD be a D-dimensional lattice, and let (A, +) be an abelian group. AM is then a co...
Abstract The main goal of this note is to classify by conjugacy classes the collection of r-cellular...
International audienceWe prove that topologically isomorphic linear cellular automaton shifts are al...
In this thesis we study measurable and topological dynamics of certain classes of cellular automata...
We prove that the group of reversible cellular automata (RCA), on any alphabet A, contains a subgrou...
Given a compact group G, a standard construction of a Z2 Markov shift SG with alphabet G is describe...
We consider the range of possible dynamics of cellular automata (CA) on two-sided beta-shifts Sβ and...
We show that the automorphism group of a one-dimensional full shift (the group of reversible cellul...
AbstractWhen G is an arbitrary group and V is a finite-dimensional vector space, it is known that ev...
We investigate decidable properties for regular cellular automata. In particular, we show that regu...
Many undecidable questions concerning cellular automata are known to be decidable when the cellular ...
We study cellular automata as discrete dynamical systems and in particular investigate under which c...
AbstractConsider the space of configurations from a finitely generated group to a finite alphabet. W...
We study the dynamical behavior of D-dimensional (D ≥ 1) additive cellular automata where the alphab...
Let $G$ be a group and let $A$ be a finite set with at least two elements. A cellular automaton (CA)...
Abstract. Let M = ZD be a D-dimensional lattice, and let (A, +) be an abelian group. AM is then a co...
Abstract The main goal of this note is to classify by conjugacy classes the collection of r-cellular...
International audienceWe prove that topologically isomorphic linear cellular automaton shifts are al...
In this thesis we study measurable and topological dynamics of certain classes of cellular automata...
We prove that the group of reversible cellular automata (RCA), on any alphabet A, contains a subgrou...
Given a compact group G, a standard construction of a Z2 Markov shift SG with alphabet G is describe...
We consider the range of possible dynamics of cellular automata (CA) on two-sided beta-shifts Sβ and...
We show that the automorphism group of a one-dimensional full shift (the group of reversible cellul...
AbstractWhen G is an arbitrary group and V is a finite-dimensional vector space, it is known that ev...
We investigate decidable properties for regular cellular automata. In particular, we show that regu...
Many undecidable questions concerning cellular automata are known to be decidable when the cellular ...
We study cellular automata as discrete dynamical systems and in particular investigate under which c...
AbstractConsider the space of configurations from a finitely generated group to a finite alphabet. W...
We study the dynamical behavior of D-dimensional (D ≥ 1) additive cellular automata where the alphab...
Let $G$ be a group and let $A$ be a finite set with at least two elements. A cellular automaton (CA)...
Abstract. Let M = ZD be a D-dimensional lattice, and let (A, +) be an abelian group. AM is then a co...
Abstract The main goal of this note is to classify by conjugacy classes the collection of r-cellular...
DOI
Add to ORKG