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

• A. Martín del Rey ^[1]
  1. [1] Universidad de Salamanca

     Universidad de Salamanca

     Salamanca, España

     
• Localización: Revista de la Unión Matemática Argentina, ISSN 0041-6932, ISSN-e 1669-9637, Vol. 56, Nº. 1, 2015, págs. 107-125
• Idioma: inglés
• Enlaces
  • Texto completo (pdf)
• Resumen

  • 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.