Producción Científica Profesorado

Emergence of density dynamics by surface interpolation in elementary cellular automata



Seck Tuoh Mora, Juan Carlos

2014

Seck-Tuoh-Mora, J. C., Medina-Marin, J., Martínez, G. J., & Hernández-Romero, N. (2014) Emergence of density dynamics by surface interpolation in elementary cellular automata. Communications in Nonlinear Science and Numerical Simulation, 19(4), 941-966.


Abstract


A classic problem in elementary cellular automata (ECAs) is the specification of numerical tools to represent and study their dynamical behaviour. Mean field theory and basins of attraction have been commonly used; however, although the first case gives the long term estimation of density, frequently it does not show an adequate approximation for the step-by-step temporal behaviour; mainly for non-trivial behaviour. In the second case, basins of attraction display a complete representation of the evolution of an ECA, but they are limited up to configurations of 32 cells; and for the same ECA, one can obtain tens of basins to analyse. This paper is devoted to represent the dynamics of density in ECAs for hundreds of cells using only two surfaces calculated by the nearest-neighbour interpolation. A diversity of surfaces emerges in this analysis. Consequently, we propose a surface and histogram based classification for periodic, chaotic and complex ECA.



Producto de Investigación




Artículos relacionados

On explicit inversion of a subclass of operators with D-difference kernels and Weyl theory of the co...

Unconventional invertible behaviors in reversible one-dimensional cellular automata.

Modeling a Nonlinear Liquid Level System by Cellular Neural Networks

Elementary cellular automaton Rule 110 explained as a block substitution system

Pair Diagram and Cyclic Properties Characterizing the Inverse of Reversible Automata

Reproducing the Cyclic Tag System Developed by Matthew Cook with Rule 110 Using the Phases f(i-)1.

Complex Dynamics Emerging in Rule 30 with Majority Memory

How to Make Dull Cellular Automata Complex by Adding Memory: Rule 126 Case Study