Abstract : For any group G and set A, a cellular automaton over G and A is a transformation defined via a finite neighbourhood (called a memory set of ) and a local function . 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 A. Let G and A. In the first part, using information on the conjugacy classes of subgroups of G, we give a detailed description of the structure of in terms of direct and wreath products. In the second part, we study generating sets of . In particular, we prove that cannot be generated by cellular automata with small memory set, and, when G is finite abelian, we determine the minimal size of a set such that .
https://hal.inria.fr/hal-01435036 Contributor : Hal IfipConnect in order to contact the contributor Submitted on : Friday, January 13, 2017 - 3:24:12 PM Last modification on : Thursday, July 19, 2018 - 4:58:10 PM Long-term archiving on: : Friday, April 14, 2017 - 8:30:52 PM
Alonso Castillo-Ramirez, Maximilien Gadouleau. On Finite Monoids of Cellular Automata. 22th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2016, Zurich, Switzerland. pp.90-104, ⟨10.1007/978-3-319-39300-1_8⟩. ⟨hal-01435036⟩