2025/03/22 by Castillo-Ramirez, Alonso, Veliz-Quintero, Eduardo
#Cellular Automata and Lattice Gases (nlin.CG) #Dynamical Systems (math.DS) #FOS: Computer and information sciences #FOS: Mathematics #FOS: Physical sciences #Formal Languages and Automata Theory (cs.FL)
paper · doi:10.48550/arxiv.2503.17881
For a group G and a finite set A, a cellular automaton is a transformation of the configuration space AG defined via a finite neighborhood and a local map. Although neighborhoods are not unique, every CA admits a unique minimal neighborhood, which consists on all the essential cells in G that affect the behavior of the local map. An active transition of a cellular automaton is a pattern that produces a change on the current state of a cell when the local map is applied. In this paper, we study the links between the minimal neighborhood and the number of active transitions, known as the activity value, of cellular automata. Our main results state that the activity value usually imposes several restrictions on the size of the minimal neighborhood of local maps.