Producción Científica Profesorado

2006

Martínez, G. J., McIntosh, H., & Seck-Tuoh-Mora, J. C. (2006). Gliders in Rule 110. International Journal of Unconventional Computing, 2(1), 1-49.

**Abstract**

The one-dimensional binary cellular automaton numbered Rule 110 in Stephen Wolfram's system of identification [47] has been an object of special attention due to the structures or gliders1 which have been observed in evolution samples from random initial conditions. It has even been suggested that Rule 110 belongs to the exceptional class IV of automata whose chaotic aspects are mixed with regular behaviors; but in this case the background where the chaotic behavior occurs is textured rather than quiescent, a tacit assumption in the original classification.

Pair Diagram and Cyclic Properties Characterizing the Inverse of Reversible Automata

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

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

Elementary cellular automaton Rule 110 explained as a block substitution system

Complex Dynamics Emerging in Rule 30 with Majority Memory

Modeling a Nonlinear Liquid Level System by Cellular Neural Networks

Unconventional invertible behaviors in reversible one-dimensional cellular automata.