Graph-theoretical characterization of invertible cellular automata
The paper considers invertible cellular automata (which are described by induced surjective global rule on the set of finite configurations). Invertibility is characterized by graph-theoretical conditions. This allows construction of complete families of various invertible automata, viewed as discrete dynamical systems.
scientific article; zbMATH DE number 1514729
scientific article