Irreducible Rules and Equivalence Classes of One-dimensional Cellular Automata

Abstract

One-dimensional cellular automata are discrete dynamical systems that operate on an infinite lattice of sites and are characterized by the locality and uniformity of their update rule. Permutations of the state set and isometric transformations of the lattice induce symmetry transformations on the set of local rules and the set of global maps of cellular automata, resulting in a partitioning of the set of cellular automata into equivalence classes. The concept of an irreducible local rule that depends on all its coordinates is used to analyse the equivalence classes and results on the number of equivalence classes of irreducible binary local rules and binary global maps are presented. Finally, another symmetry operator based on the scaling of neighbourhoods is introduced and the change in the number of equivalence classes is analysed.