Producción Científica Profesorado

Invertible behavior in elementary cellular automata with memory

Seck Tuoh Mora, Juan Carlos


Seck Tuoh, J.C., Martínez, G. J., Alonso-Sanz, R., & Hernández-Romero, N. (2012). Invertible behavior in elementary cellular automata with memory. Information Sciences, 199, 125-132.


Elementary cellular automata (ECAs) have been studied for their ability to generate complex global behavior, despite their simplicity. One variation of ECAs is obtained by adding memory to each cell in a neighborhood. This process generates a provisional configuration in which the application of an evolution rule establishes the dynamics of the system. This version is known as an ECA with memory (ECAM). Most previous work on ECAMs analyzed the complex behavior taking chaotic ECAs. However, the present paper investigates reversible ECAMs as obtained from reversible and permutative ECAs. These ECAs have at least one ancestor for every configuration: thus, the correct permutation of states may specify the memory function to obtain reversible ECAMs. For permutative ECAs, which are often irreversible, we demonstrate that the use of a quiescent state and the correct manipulation of de Bruijn blocks produce reversible ECAMs.

Producto de Investigación

Artículos relacionados

Pair Diagram and Cyclic Properties Characterizing the Inverse of Reversible Automata

Modeling a Nonlinear Liquid Level System by Cellular Neural Networks

On explicit inversion of a subclass of operators with D-difference kernels and Weyl theory of the co...

Elementary cellular automaton Rule 110 explained as a block substitution system

Unconventional invertible behaviors in reversible one-dimensional cellular automata.

Complex Dynamics Emerging in Rule 30 with Majority Memory

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.