A generalization of cellular automata over groups

A. Castillo-Ramirez, M. Sanchez-Alvarez, A. Vazquez-Aceves +1

Let $G$ be a group and let $A$ be a finite set with at least two elements. A cellular automaton (CA) over $A^G$ is a function $\tau :A^G\to A^G$ defined via a finite memory set $S \s…