Cellular Automata with Symmetric Local Rules
Vladimir V. Kornyak
Abstract
The cellular automata with local permutation invariance are considered. We show that in the two-state case the set of such automata coincides with the generalized Game of Life family. We count the number of equivalence classes of the rules under consideration with respect to permutations of states. This reduced number of rules can be efficiently generated in many practical cases by our C program. Since a cellular automaton is a combination of a local rule and a lattice, we consider also maximally symmetric two-dimensional lattices. In addition, we present the results of compatibility analysis of several rules from the Life family.
Create a lesson
Related papers
2-Morita Theory of E2-Algebras and Module Categories
Rongge Xu, Holiverse Yang
Multiscale Loop Vertex Expansion for Cumulants, the ϕ42 Model
Vincent Rivasseau
Quasi-polynomiality and N-point functions of single connected leaky completed Hurwitz numbers
Chongyu Wang, Chenglang Yang
Coupled stochastic variational principles for multiscale surface gravity waves -- Part I: theoretical framework
Etienne Mémin, Arnaud Debussche
The Sharp Spectral Transition for Almost Mathieu Operators via Alternating Resonances
Jiawei He, Xueyin Wang
Dynamical classical-field limit of Bosonic Gibbs states: Renormalized Hartree NLS correlations in 2D and 3D
Phan Thành Nam, Rongchan Zhu, Xiangchan Zhu