Mining and Cataloguing the Computational Universe of Cellular Automata

Rodrigo Obando

One-dimensional cellular automata rules are defined by k number of values with r as the range of neighboring cells used in the rule. As an example, the elementary cellular automata (ECA) is the rule set where k = 2 and r = 1. Rodrigo Obando presents a transformation of a cellular automata rule into a vector space. Specific examples of this transformation and other related equations are also discussed.