Producción Científica Profesorado

Determining a Regular Language by Glider-Based Structures called Phases f(i)-1 in Rule 110



Seck Tuoh Mora, Juan Carlos

2008

Martínez, G. J., McIntosh, H. V., Seck-Tuoh-Mora, J. C., & Chapa-Vergara, S. V. (2008). Determining a Regular Language by Glider-Based Structures called Phases f(i)-1 in Rule 110. Journal of Cellular Automata, 3, 231-270.


Abstract


Rule 110 is a complex elementary cellular automaton able of support universal computation and complicated collision-based reactions between gliders. We propose a representation for coding initial conditions by means of a finite subset of regular expressions. The sequences are extracted both from de Bruijn diagrams and tiles specifying a set of phases f i_1 for each glider in Rule 110. The subset of regular expressions is explained in detail.






Artículos relacionados

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

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

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