Search

In this paper, we study one dimensional finite linear cellular automata with reflective boundary condition by using matrix algebra built on the field ℤp. We present an algorithm for determining the reversibility of this family of cellular automata. We also answer the reversibility question for some special subfamilies. Finally, we present some examples of this family of cellular automata under the reflective boundary condition. [ABSTRACT FROM AUTHOR]

The reversibility problem for linear cellular automata with null boundary defined by a rule matrix in the form of a pentadiagonal matrix was studied recently over the binary field ℤ (del Rey and Rodriguez Sánchez in Appl. Math. Comput., , doi:). In this paper, we study one-dimensional linear cellular automata with periodic boundary conditions over any finite field ℤ. For any given p≥2, we show that the reversibility problem can be reduced to solving a recurrence relation depending on the number of cells and the coefficients of the local rules defining the one-dimensional linear cellular automata. More specifically, for any given values (from any fixed field ℤ) of the coefficients of the local rules, we outline a computer algorithm determining the recurrence relation which can be solved by testing reversibility of the cellular automaton for some finite number of cells. As an example, we give the full criteria for the reversibility of the one-dimensional linear cellular automata over the fields ℤ and ℤ. [ABSTRACT FROM AUTHOR]