ON 1D REVERSIBLE CELLULAR AUTOMATA WITH REFLECTIVE BOUNDARY OVER THE PRIME FIELD OF ORDER p

Abstract

In this paper, we study one dimensional finite linear cellular automata with reflective boundary condition by using matrix algebra built on the field Z(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.