2009
Seck-Tuoh-Mora J. C., Gonzalez-Hernandez M., McIntosh H. V., & Chapa-Vergara S. V. (2009). Construction of Reversible Cellular Automata by Amalgamations and Permutations of States. Journal of Cellular Automata, 4, 331-342.
Abstract
This paper explains the properties of amalgamations and permutations of states in the matrix representation of reversible one-dimensional cellular automata where both evolution rules have neighborhood size 2 and a Welch index equal to 1. These properties are later used for constructing reversible automata and defining a compact nomenclature to identify them. Some examples are provided.
Modeling a Nonlinear Liquid Level System by Cellular Neural Networks
Elementary cellular automaton Rule 110 explained as a block substitution system
Complex Dynamics Emerging in Rule 30 with Majority Memory
Pair Diagram and Cyclic Properties Characterizing the Inverse of Reversible Automata
Unconventional invertible behaviors in reversible one-dimensional cellular 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.