2006
Seck-Tuoh-Mora, J. C., Martínez, G. J., & McIntosh, H. V. (2006). The inverse behavior of a reversible one-dimensional cellular automaton obtained by a single Welch diagram. Journal of Cellular Automata, 1(1), 25-39.
Abstract
Reversible cellular automata are discrete dynamical systems based on local interactions which are able to produce an invertible global behavior. Reversible automata have been carefully analyzed by means of graph and matrix tools, in particular the extensions of the ancestors in these systems have a complete representation by Welch diagrams. This paper illustrates how the whole information of a reversible one-dimensional cellular automaton is conserved at both sides of the ancestors for sequences with an adequate length. We give this result implementing a procedure to obtain the inverse behavior by means of calculating and studying a single Welch diagram corresponding with the extensions of only one side of the ancestors. This work is a continuation of our study about reversible automata both in the local [15] and global [16] sense. An illustrative example is also presented.
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
Unconventional invertible behaviors in reversible one-dimensional cellular automata.
How to Make Dull Cellular Automata Complex by Adding Memory: Rule 126 Case Study
Complex Dynamics Emerging in Rule 30 with Majority Memory
Modeling a Nonlinear Liquid Level System by Cellular Neural Networks
Pair Diagram and Cyclic Properties Characterizing the Inverse of Reversible Automata