The Curious Case of Reversible Elementary Second Order Cellular Automaton 115

2026/06/11 by Enrico Formenti, Supreeti Kamylia · 1 voice
Computer Science · Mathematics · #cs.DM #math.CO #math.DS

paper · pdf · doi:10.4204/eptcs.445.12

Abstract

We prove that the reversible elementary second order cellular automaton rule 115 is periodic when started on finite initial configurations. We also study some families of finite configurations that have interesting period functions.

Citations

• On the dynamical behaviour of linear higher-order cellular automata and its decidability
• A Full Computation-relevant Topological Dynamics Classification of Elementary Cellular Automata
• Endomorphisms and automorphisms of the shift dynamical system

Discussions

• Enrico Formenti, Supreeti Kamylia: The Curious Case of Reversible Elementary Second Order Cellular Automaton 115 https://arxiv.org/abs/2606.13159 https://arxiv.org/pdf/2606.13159 https://arxiv.org/htm [bsky, 0 points, 0 comments]

Related

• The Structure of Configurations in One-Dimensional Majority Cellular Automata: From Cell Stability to Configuration Periodicity
• Some topological properties of one dimensional cellular automata
• Jointly periodic points in cellular automata: computer explorations and conjectures
• One-dimensional cellular automata with random rules: longest temporal period of a periodic solution
• Temporally Non-Uniform Cellular Automata: Surjectivity, Reversibility and Cyclic Behavior