An efficiently computable characterization of stability and instability for linear cellular automata

We provide an efficiently computable characterization of two important properties describing stable and unstable complex behaviours as equicontinuity and sensitivity to the initial conditions for one-dimensional linear cellular automata (LCA) over . We stress that the setting of LCA over with is more expressive, it gives rise to much more complex dynamics, and it is more difficult to deal with than the already investigated case . Indeed, in order to get our result we need to prove a nontrivial result of abstract algebra: if is any finite commutative ring and is any -algebra, then for every pair A, B of matrices over having the same characteristic polynomial, it holds that the set is finite if and only if the set is finite too.