no code implementations • 22 Dec 2020 • Yerim Song, Joshua A. Grochow
Here we introduce a new, more efficient algorithm for finding coarse-grainings between any two given CA that allows us to systematically explore all elementary CA with supercell sizes up to $N=7$, and to explore individual examples of even larger supercell size.
Cellular Automata and Lattice Gases Statistical Mechanics Data Structures and Algorithms Pattern Formation and Solitons 37B15, 68Q80, 68W05 F.2.2; G.4
