Jan 21, 2016 · In this paper, we assume that G and A are both finite and study various algebraic properties of the finite monoid \text{CA}(G,A) consisting of ...
scholar.google.com › citations
Jan 13, 2017 · In this paper, we assume that G and A are both finite and study various algebraic properties of the finite monoid CA(G, A) consisting of all cel ...
In this paper, we assume that G and A are both finite and study various algebraic properties of the finite monoid consisting of all cellular automata over G and ...
In this paper, we assume that G and A are both finite and study various algebraic properties of the finite monoid CA(G,A) consisting of all cellular automata ...
In this paper, we assume that G and A are both finite and study various algebraic properties of the finite monoid CA(G;A) consisting of all cellular automata ...
In this paper, we assume that G and A are both finite and study various algebraic properties of the finite monoid CA(G,A)CA(G,A) consisting of all cellular ...
Jan 21, 2016 · Abstract. For any group G and set A, a cellular automaton over G and A is a transformation τ : AG → AG defined via a finite neighborhood S ...
It is proved that $\text{CA}(G,A)$ cannot be generated by cellular automata with small memory set, and, when $G$ is finite abelian, the minimal size of a ...
In this paper, we assume that G and A are both finite and study various algebraic properties of the finite monoid CA(G;A) consisting of all cellular automata ...
Araújo, J., Bentz, W., Mitchell, J.D., Schneider, C.: The rank of the semigroup of transformations stabilising a partition of a finite set. Mat. Proc. Camb.