A generalization of cellular automata over groups
From MaRDI portal
Abstract: Let be a group and let be a finite set with at least two elements. A cellular automaton (CA) over is a function defined via a finite memory set and a local function . The goal of this paper is to introduce the definition of a generalized cellular automaton (GCA) , where is another arbitrary group, via a group homomorphism . 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 , we prove that the group of invertible GCA over is isomorphic to a semidirect product of and the group of invertible CA. Finally, we apply our results to study automorphisms of the monoid consisting of all CA over . In particular, we show that every defines an automorphism of via conjugation by the invertible GCA defined by , and that, when is abelian, is embedded in the outer automorphism group of .
Recommendations
Cites work
- An Introduction to Symbolic Dynamics and Coding
- Cellular automata and groups
- Elementary, finite and linear vN-regular cellular automata
- scientific article; zbMATH DE number 706263 (Why is no real title available?)
- scientific article; zbMATH DE number 726524 (Why is no real title available?)
- scientific article; zbMATH DE number 894528 (Why is no real title available?)
Cited in
(21)- The Pascal matroid as a home for generating sets of cellular automata configurations defined by quasigroups
- Permutive one-way cellular automata and the finiteness problem for automaton groups
- Bounding the minimal number of generators of groups and monoids of cellular automata
- Linear cellular automata over modules of finite length and stable finiteness of group rings
- Generalized Gandy-Păun-Rozenberg Machines for Tile Systems and Cellular Automata
- CELLULAR AUTOMATA OVER SEMI-DIRECT PRODUCT GROUPS: REDUCTION AND INVERTIBILITY RESULTS
- scientific article; zbMATH DE number 5343230 (Why is no real title available?)
- scientific article; zbMATH DE number 1136074 (Why is no real title available?)
- scientific article; zbMATH DE number 6149843 (Why is no real title available?)
- Cellular automata over algebraic structures
- Universal groups of cellular automata
- Generalized linear cellular automata in groups and difference Galois theory
- scientific article; zbMATH DE number 5582847 (Why is no real title available?)
- Cellular automata on a G-set
- Groups and Monoids of Cellular Automata
- A note on cellular automata
- Decidable characterizations of dynamical properties for additive cellular automata over a finite abelian group with applications to data encryption
- Further results on generalized cellular automata
- Cellular automata on group sets and the uniform Curtis-Hedlund-Lyndon theorem
- The Garden of Eden theorem over generalized cellular automata
- Categorical products of cellular automata
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)