A note on the reversibility of the elementary cellular automaton with rule number 90
- 1 Universidad de Salamanca, España
ISSN: 1669-9637, 0041-6932
Ano de publicación: 2015
Volume: 56
Número: 1
Páxinas: 107-125
Tipo: Artigo
Outras publicacións en: Revista de la Unión Matemática Argentina
Resumo
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.