Enumeration of Number-Conserving Cellular Automata Rules with Two Inputs

Cellular automata (CA) rules possessing additive invarian ts have been studied since early 90’s. The simplest form of an additive invari ant is the sum of all site values over a finite lattice with periodic boundary c onditions. Rules with such an invariant are known as number-conserving rules , and they exhibit many interesting properties. For example… CONTINUE READING