2000 character limit reached
On the Number of ON Cells in Cellular Automata
Published 4 Mar 2015 in math.CO | (1503.01168v1)
Abstract: If a cellular automaton (CA) is started with a single ON cell, how many cells will be ON after n generations? For certain "odd-rule" CAs, including Rule 150, Rule 614, and Fredkin's Replicator, the answer can be found by using the combination of a new transformation of sequences, the run length transform, and some delicate scissor cuts. Several other CAs are also discussed, although the analysis becomes more difficult as the patterns become more intricate.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.