论文信息 - A two-layer representation of four-state reversible number-conserving 2D cellular automata

A two-layer representation of four-state reversible number-conserving 2D cellular automata

We present a novel representation of 1D reversible and number-conserving cellular automata with four states. Carrying this view over to two dimensions, we are able to construct 65 four-state reversible and number-conserving 2D cellular automata with the von Neumann neighborhood. A clever use of the split-and-perturb decomposition of number-conserving CAs allows to prove by elimination that this list is complete.

[1] Bernard De Baets,et al. Efficient enumeration of three-state two-dimensional number-conserving cellular automata , 2020, Inf. Comput..

[2] Kenichi Morita,et al. Theory of Reversible Computing , 2017, Monographs in Theoretical Computer Science. An EATCS Series.

[3] Enrico Formenti,et al. Number-conserving cellular automata I: decidability , 2003, Theor. Comput. Sci..

[4] Bernard De Baets,et al. A split-and-perturb decomposition of number-conserving cellular automata , 2019, 1901.05067.