Producción Científica Profesorado

2010

Seck-Tuoh-Mora, J. C., Martínez, G. J., Hernández-Romero N., & Medina-Marin, J. (2010). Elementary cellular automaton Rule 110 explained as a block substitution system. Computing, 88(3-4), 193-205.

**Abstract**

This paper presents the characterization of Rule 110 as a block substitution system of three symbols. Firstly, it is proved that the dynamics of Rule 110 is equivalent to cover the evolution space with triangles formed by the cells of the automaton. It is hence demonstrated that every finite configuration can be partitioned in several blocks of symbols and, that the dynamics of Rule 110 can be reproduced by a set of production rules applied to them. The shape of the blocks in the current configuration can be used for knowing the number of them in the next one; with this, the evolution of random configurations, ether and gliders can be modeled.

Modeling a Nonlinear Liquid Level System by Cellular Neural Networks

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

Unconventional invertible behaviors in reversible one-dimensional cellular automata.

Complex Dynamics Emerging in Rule 30 with Majority Memory

Pair Diagram and Cyclic Properties Characterizing the Inverse of Reversible Automata

Elementary cellular automaton Rule 110 explained as a block substitution system

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