Reversible cellular automata are invertible dynamical systems characterized by discreteness, determinism and local interaction. This article studies the local behavior of reversible one-dimensional cellular automata by means of the spectral properties of their connectivity matrices. We use the transformation from every one-dimensional cellular automaton to another of neighborhood size 2 to generalize the results exposed in this paper. In particular we prove that the connectivity matrices have a single positive eigenvalue equal to 1; based on this result we also prove the main result of this paper: the idempotent behavior of these matrices. This property is an important feature for detecting which one-dimensional cellular automata are reversible. Hence we present a procedure using the eigenvectors of these matrices to find the inverse rule for a given reversible one-dimensional cellular automaton. Finally illustrative examples are provided.
展开▼