Producción Científica Profesorado

Procedures for calculating reversible one-dimensional cellular automata



Seck Tuoh Mora, Juan Carlos

2005

Seck-Tuoh-Mora, J. C., Chapa-Vergara, S. V., Martínez, G. J., & McIntosh, H. V. (2005). Procedures for calculating reversible one-dimensional cellular automata. Physica D - Nonlinear Phenomena, 202(1-2), 134-141.


Abstract


We describe two algorithms for calculating reversible one-dimensional cellular automata of neighborhood size 2. We explain how this kind of automaton represents all the other cases. Using two basic properties of reversible automata such as uniform multiplicity of ancestors and Welch indices, these algorithms only require matrix products and transitive closures of binary relations to classify all the possible reversible automata of neighborhood size 2. We expose the features, advantages and differences with other well-known methods. Finally, we present results for reversible automata from three to six states and neighborhood size 2.



Producto de Investigación




Artículos relacionados

Modeling a Nonlinear Liquid Level System by Cellular Neural Networks

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

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

Complex Dynamics Emerging in Rule 30 with Majority Memory

Pair Diagram and Cyclic Properties Characterizing the Inverse of Reversible Automata

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