One-way cellular automata on Cayley graphs

AbstractThe notion of one-dimensional one-way cellular automata has been introduced to model cellular automata with only a one-way communication between two neighbor cells. In this paper, we generalize this notion to cellular automata working on different communication graphs We present some sufficient conditions for a cellular automaton to be stimulated by a one-way cellular automaton having the same underlying graph, and we give some bounds on the simulation-time of this mimic