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 ℤ2 (del Rey and Rodriguez Sánchez in Appl. Math. Comput., 2011, doi:10.1016/j.amc.2011.03.033). In this paper, we study one-dimensional linear cellular automata with periodic boundary conditions over any finite field ℤp. 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 ℤp) 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 ℤ2 and ℤ3.
Mora, J.C.S.T., Vergara, S.V.C., Martýnez, G.J., McIntosh, H.V.: Procedures for calculating reversible one-dimensional cellular automata. Physica D 202, 134–141 (2005)
Seck, J.C., Juarez, G., McIntosh, H.V.: The inverse behaviour of a reversible one-dimensional cellular automaton obtained by a single Welch diagram. J. Cell. Autom. 1, 25–39 (2006)
von Neumann, J.: Theory and organization of complicated automata. In: Burks, A.W. (ed.) The Theory of Self-Reproducing Automata. University of Illinois Press, Urbana (1996)
Wolfram, S.: A New Kind of Science. Wolfram Media Inc., Champaign (2002)