1. Cellular automata and communication complexity;Durr;Theoretical Computer Science,2004
2. Understanding a non-trivial cellular automaton by finding its simplest underlying communication protocol;Goles,2008
3. Cellular automaton rules conserving the number of active sites;Boccara;Journal of Physics A: Mathematical and General,1998
4. Number-conserving cellular automaton rules;Boccara;Fundamenta Informaticae,2001
5. A class of cellular automata equivalent to deterministic particle systems;Fukś,2000