On Finite Monoids of Cellular Automata

  title={On Finite Monoids of Cellular Automata},
  author={Alonso Castillo-Ramirez and Maximilien Gadouleau},
For any group $G$ and set $A$, a cellular automaton over $G$ and $A$ is a transformation $\tau : A^G \to A^G$ defined via a finite neighborhood $S \subseteq G$ (called a memory set of $\tau$) and a local function $\mu : A^S \to A$. 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 all cellular automata over $G$ and $A$. Let $\text{ICA}(G;A)$ be the group of invertible cellular automata over $G… Expand
Cellular automata and finite groups
It is proved that CA (G;A) cannot be generated by cellular automata with small memory set, and, when all subgroups of G are normal, the relative rank of CA is determined, i.e. the minimal size of a set is determined. Expand
Bounding the minimal number of generators of groups of cellular automata
This work studies the minimal cardinality of a generating set, known as the rank, of the monoid of all cellular automata over a group and finds a basic lower bound for the rank of $\text{ICA}(G;A)$ when $G$ is a finite group. Expand
Bounding the Minimal Number of Generators of Groups and Monoids of Cellular Automata
This work studies the minimal cardinality of a generating set, known as the rank, of the monoid of all cellular automata over a group and finds a basic lower bound for the rank of $\text{ICA}(G;A)$ when $G$ is a finite group. Expand
Elementary, Finite and Linear vN-Regular Cellular Automata
It is established that, over any nontrivial configuration space, there always exist CA that are not vN-regular, and it is shown that rules like 128 and 254 are vn-regular (and actually generalised inverses of each other), while others, like the well-known rules $90 and $110, are notvN- regular. Expand
Von Neumann Regular Cellular Automata
A generalisation of the inverse of a CA from the semigroup-theoretic perspective is investigated, establishing that every regular linear CA is invertible when G is torsion-free and that everylinear CA is regular when V is finite-dimensional and G is locally finite. Expand
Some Algebraic Properties Of Linear Synchronous Cellular Automata
Relation between global transition function and local transition function of a homogeneous one dimensional cellular automaton (CA) is investigated for some standard transition functions. It could beExpand
Evolutions of Some One-Dimensional Homogeneous Cellular Automata
With respect to some initial configurations, evolution-wise equivalent Wolfram codes are investigated and it is shown that these equivalent codes are automorphic. Expand
Generating infinite monoids of cellular automata
For a group [Formula: see text] and a set [Formula: see text], let [Formula: see text] be the monoid of all cellular automata over [Formula: see text], and let [Formula: see text] be its group ofExpand
On the minimal number of generators of endomorphism monoids of full shifts
For a group G and a finite set A , denote by $$\mathrm{End}(A^G)$$ End ( A G ) the monoid of all continuous shift commuting self-maps of $$A^G$$ A G and by $$\mathrm{Aut}(A^G)$$ Aut ( A G ) its groupExpand


Ranks of finite semigroups of one-dimensional cellular automata
Since first introduced by John von Neumann, the notion of cellular automaton has grown into a key concept in computer science, physics and theoretical biology. In its classical setting, a cellularExpand
The rank of the semigroup of transformations stabilising a partition of a finite set
Abstract Let $\mathcal{P}$ be a partition of a finite set X. We say that a transformation f : X → X preserves (or stabilises) the partition $\mathcal{P}$ if for all P ∈ $\mathcal{P}$ there exists Q ∈Expand
Large semigroups of cellular automata
  • Yair Hartman
  • Mathematics, Computer Science
  • Ergodic Theory and Dynamical Systems
  • 2011
Semigroups of transformations of cellular automata which act on a fixed shift space are considered and two properties of these semigroups which relate to ‘largeness’ are interested: first, a semigroup has the ID property if the only infinite invariant closed set is the entire space; the second property is maximal commutativity (MC). Expand
Theory of cellular automata: A survey
  • J. Kari
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 2005
The main goal is to provide a tutorial of CA theory to researchers in other branches of natural computing, to give a compact collection of known results with references to their proofs, and to suggest some open problems. Expand
The minimal number of generators of a finite semigroup
The rank of a finite semigroup is the smallest number of elements required to generate the semigroup. A formula is given for the rank of an arbitrary (not necessarily regular) Rees matrix semigroupExpand
Cellular Automata and Groups
Theorem: Finitely Generated Amenable Groups + Local Embeddability and Sofic Groups + Uniform Structures + Complements of Functional Analysis + Ultrafilters = 6. Expand
The rank of the endomorphism monoid of a uniform partition
The rank of a semigroup is the cardinality of a smallest generating set. In this paper we compute the rank of the endomorphism monoid of a non-trivial uniform partition of a finite set, that is, theExpand
On the ranks of certain finite semigroups of transformations
It is well-known (see [2]) that the finite symmetric group S n has rank 2. Specifically, it is known that the cyclic permutations generate S n ,. It easily follows (and has been observed by Vorob'evExpand
Groups and Monoids of Cellular Automata
  • V. Salo
  • Mathematics, Computer Science
  • Automata
  • 2015
Groups and monoids defined by cellular automata on full shifts, sofic shifts, minimal subsh shifts, countable subshifts and coded and synchronized systems are discussed. Expand
Classical Finite Transformation Semigroups: An Introduction
Ordinary and Partial Transformations.- The Semigroups T n, PT n, and IS n.- Generating Systems.- Ideals and Green ' s Relations.- Subgroups and Subsemigroups.- Other Relations on Semigroups.-Expand