Linear cellular automata with boundary conditions

AbstractThe main results of the paper concern graphs of linear cellular automata with boundary conditions. We show that the connected components of such graphs are direct sums of trees and cycles, and we provide a complete characterization of the trees, as well as enumerate the cycles of various lengths. Our work generalizes and clarifies results obtained previously in special cases