A generalization of cellular automata over groups

From MaRDI portal



Abstract: Let G be a group and let A be a finite set with at least two elements. A cellular automaton (CA) over AG is a function au:AGoAG defined via a finite memory set SsubseteqG and a local function mu:ASoA. The goal of this paper is to introduce the definition of a generalized cellular automaton (GCA) au:AGoAH, where H is another arbitrary group, via a group homomorphism phi:HoG. Our definition preserves the essence of CA, as we prove analogous versions of three key results in the theory of CA: a generalized Curtis-Hedlund Theorem for GCA, a Theorem of Composition for GCA, and a Theorem of Invertibility for GCA. When G=H, we prove that the group of invertible GCA over AG is isomorphic to a semidirect product of extAut(G)op and the group of invertible CA. Finally, we apply our results to study automorphisms of the monoid extCA(G;A) consisting of all CA over AG. In particular, we show that every phiinextAut(G) defines an automorphism of extCA(G;A) via conjugation by the invertible GCA defined by phi, and that, when G is abelian, extAut(G) is embedded in the outer automorphism group of extCA(G;A).











This page was built for publication: A generalization of cellular automata over groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6039089)