Reversible elementary cellular automaton with rule number 150 and periodic boundary conditions over 𝔽p
A. Martı́n del Rey, G. Rodríguez Sánchez
Abstract
A. Martı́n del Rey, G. Rodríguez Sánchez
Abstract
The study of the reversibility of elementary cellular automata with rule number 150 over the finite state set 𝔽p and endowed with periodic boundary conditions is done. The dynamic of such discrete dynamical systems is characterized by means of characteristic circulant matrices, and their analysis allows us to state that the reversibility depends on the number of cells of the cellular space and to explicitly compute the corresponding inverse cellular automata.
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The study of the reversibility of elementary cellular automata with rule number 150 over the finite state set 𝔽p and endowed with periodic boundary conditions is done. The dynamic of such discrete dynamical systems is characterized by means of characteristic circulant matrices, and their analysis allows us to state that the reversibility depends on the number of cells of the cellular space and to explicitly compute the corresponding inverse cellular automata.
Key concepts: Cellular automaton, Elementary cellular automaton, Stochastic cellular automaton, Continuous spatial automaton, Mathematics, Circulant matrix, Reversible cellular automaton, Boundary (topology)