When do lazy and invertible cellular automata generate all cellular automata?

Edgar Alcalá-Arroyo, Alonso Castillo-Ramirez

Let $G$ be a group and let $A$ be a set with at least two elements. A lazy cellular automaton over $A^G$ acts as the identity except at the cells where a fixed pattern occurs, wher…