2016
Juan Carlos Seck Tuoh Mora, Norberto Hernandez Romero, and Joselito Medina Marin
Abstract
A cellular automaton (CA) is reversible if it repeats its configuration in a cycle.Reversible one-dimensional CA are studied as automorphisms of the shift dynamicalsystem, and analyses using graph-theoretical approaches and with block permutations. Reversible CA are dynamical systems which conserve their initial information.This is why they pose a particular interest in mathematics, coding and cryptography.
Pair Diagram and Cyclic Properties Characterizing the Inverse of Reversible Automata
Complex Dynamics Emerging in Rule 30 with Majority Memory
Modeling a Nonlinear Liquid Level System by Cellular Neural Networks
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.
Elementary cellular automaton Rule 110 explained as a block substitution system