Producción Científica Profesorado

2002

Seck Tuoh Mora, Juan carlos

**Abstract**

The problem of knowing and characterizing the transitive behavior of a given cellular automaton is a very interesting topic. This paper provides a matrix representation of the global dynamics in reversible one-dimensional cellular automata with a Welch index 1, i.e. those where the ancestors differ just at one end. We prove that the transitive closure of this matrix shows diverse types of transitive behaviors in these systems. Part of the theorems in this paper are reductions of well-known results in symbolic dynamics. This matrix and its transitive closure were computationally implemented, and some examples are presented.

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

Modeling a Nonlinear Liquid Level System by Cellular Neural Networks

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

Elementary cellular automaton Rule 110 explained as a block substitution system

Unconventional invertible behaviors in reversible one-dimensional cellular automata.