Producción Científica Profesorado

2011

Martínez G. J., McIntosh H. V., Seck-Tuoh-Mora J. C., & Chapa-Vergara S. V. (2011) Reproducing the Cyclic Tag System Developed by Matthew Cook with Rule 110 Using the Phases f(i-)1. Journal of Cellular Automata, 6(2-3), 121-161.

**Abstract**

This paper implements the cyclic tag system (CTS) in Rule 110 developed by Cook in [1, 2] using regular expressions denominated phases fi_1 [3]. The main problem in CTS is coding the initial condition based in a system of gliders. In this way, we develop a method to control the periodic phases of the strings representing all gliders until now known in Rule 110, including glider guns. These strings form a subset of regular expressions implemented in a computational system to facilitate the construction of CTS. Thus, these phases are useful to establish distances and positions for every glider and then to delineate more sophisticated components or packages of gliders. In this manuscript, it is possible to find differences with the results exposed in Wolframs book [2], inclusively some mistakes which avoid to obtain an appropriated realization of CTS in Rule 110; fortunately, these irregularities were discussed and clarified by Cook.

Pair Diagram and Cyclic Properties Characterizing the Inverse of Reversible Automata

Elementary cellular automaton Rule 110 explained as a block substitution system

Modeling a Nonlinear Liquid Level System by Cellular Neural Networks

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

Complex Dynamics Emerging in Rule 30 with Majority Memory

Unconventional invertible behaviors in reversible one-dimensional cellular automata.

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