Title: A note on the reversibility of the elementary cellular automaton with rule number 90
Abstract: 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.
Publication Year: 2015
Publication Date: 2015-01-01
Language: en
Type: article
Access and Citation
Cited By Count: 4
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot