Cellular automata produce spatial patterns when specific rules for time development are given. This paper deals with an inverse
problem of identifying the rules for spatial patterns given. Although only rules of one-dimensional elementary cellular automata
and one-dimensional probabilistic cellular automata have shown here, the system can deal with two-dimensional one. When the
rule identification has not been fully successful due to the lack of information in the spatial pattern, the system is able
to give an identifiable part of the rules with a format of Wolfram’s rule number.
Key words Complex systems - Reverse engineering - Cellular automata - State transition rules - Rule number
This work was presented in part at the 13th International Symposium on Artificial Life and Robotics, Oita, Japan, January
31–February 2, 2008