Computability via Cellular Automata

Cellular automata present great variability in their temporal evolutions due to the number of rules and initial configurations. The possibility of automatically classifying its dynamic behavior would be of great value when studying properties of its dynamics. By counting on elementary cellular automata, and considering its temporal evolution as binary images, the authors created a texture descriptor of the images - based on the neighborhood configurations of the cells in temporal evolutions - so that it could be associated to each dynamic behavior class, following the scheme of Wolfram's classic classification. It was then possible to predict the class of rules of a temporal evolution of an elementary rule in a more effective way than others in the literature in terms of precision and computational cost. By applying the classifier to the larger neighborhood space containing 4 cells, accuracy decreased to just over 70%. However, the classifier is still able to provide some information about the dynamics of an unknown larger space with reduced computational cost.

show abstract

Computability via Cellular Automata

Cited by 2 publications

References 26 publications

The Review of Cellular Automata Algorithms for Placement and Routing Problems

The Review of Cellular Automata Algorithms for Placement and Routing Problems

Automatic Texture Based Classification of the Dynamics of One-Dimensional Binary Cellular Automata

Contact Info

Product

Resources

About