A note on the reversibility of the elementary cellular automaton with rule number 90

  1. A. Martín del Rey 1
  1. 1 Universidad de Salamanca, España
Revista:
Revista de la Unión Matemática Argentina

ISSN: 1669-9637 0041-6932

Any de publicació: 2015

Volum: 56

Número: 1

Pàgines: 107-125

Tipus: Article

Altres publicacions en: Revista de la Unión Matemática Argentina

Resum

The reversibility properties of the elementary cellular automaton with rule number 90 are studied. It is shown that the cellular automaton considered is not reversible when periodic boundary conditions are considered, whereas when null boundary conditions are stated, the reversibility appears when the number of cells of the cellular space is even. The DETGTRI algorithm is used to prove these statements. Moreover, the explicit expressions of inverse cellular automata of reversible ones are computed.