Non-uniform number-conserving elementary cellular automata

In this paper, we investigate non-uniform elementary cellular automata (i.e., one-dimensional cellular automata whose cells can use different Wolfram rules to update their states) in the context of number conservation. As a result, we obtain an exhaustive characterization of such number-conserving cellular automata on all finite grids both with periodic and null boundary conditions. The characterization obtained allows, inter alia, to enumerate all number-conserving non-uniform elementary cellular automata, in particular those that are reversible. Surprisingly, the numbers obtained are closely related to the Fibonacci sequence.

Automated summary

In this paper, the authors investigate non-uniform elementary cellular automata and their relationship with number conservation. They provide a comprehensive characterization of number-conserving cellular automata on finite grids with both periodic and null boundary conditions. The obtained characterization allows for the enumeration of all number-conserving non-uniform elementary cellular automata, revealing a surprising connection to the Fibonacci sequence.