The identification of cellular automata

Although cellular automata have been widely studied as a class of the spatio temporal systems, very few investigators have studied how to identify the CA rules given observations of the patterns. A solution using a polynomial realization to describe the CA rule is reviewed in the present study based on the application of an orthogonal least squares algorithm. Three new neighbourhood detection methods are then reviewed as important preliminary analysis procedures to reduce the complexity of the estimation. The identification of excitable media is discussed using simulation examples and real data sets and a new method for the identification of hybrid CA is introduced

Exploring Ancient Architectural Designs with Cellular Automata\ud

The paper discusses the utilization of three-dimensional cellular automata employing the two-dimensional totalistic cellular automata to simulate how simple rules could emerge a highly complex architectural designs of some Indonesian heritages. A detailed discussion is brought to see the simple rules applied in Borobudur Temple, the largest ancient Buddhist temple in the country with very complex detailed designs within. The simulation confirms some previous findings related to measurement of the temple as well as some other ancient buildings in Indonesia. This happens to open further exploitation of the explanatory power presented by cellular automata for complex architectural designs built by civilization not having any supporting sophisticated tools, even standard measurement systems

Growth and Decay in Life-Like Cellular Automata

We propose a four-way classification of two-dimensional semi-totalistic cellular automata that is different than Wolfram's, based on two questions with yes-or-no answers: do there exist patterns that eventually escape any finite bounding box placed around them? And do there exist patterns that die out completely? If both of these conditions are true, then a cellular automaton rule is likely to support spaceships, small patterns that move and that form the building blocks of many of the more complex patterns that are known for Life. If one or both of these conditions is not true, then there may still be phenomena of interest supported by the given cellular automaton rule, but we will have to look harder for them. Although our classification is very crude, we argue that it is more objective than Wolfram's (due to the greater ease of determining a rigorous answer to these questions), more predictive (as we can classify large groups of rules without observing them individually), and more accurate in focusing attention on rules likely to support patterns with complex behavior. We support these assertions by surveying a number of known cellular automaton rules.Comment: 30 pages, 23 figure

Localization dynamics in a binary two-dimensional cellular automaton: the Diffusion Rule

We study a two-dimensional cellular automaton (CA), called Diffusion Rule (DR), which exhibits diffusion-like dynamics of propagating patterns. In computational experiments we discover a wide range of mobile and stationary localizations (gliders, oscillators, glider guns, puffer trains, etc), analyze spatio-temporal dynamics of collisions between localizations, and discuss possible applications in unconventional computing.Comment: Accepted to Journal of Cellular Automat