The parallelism principle: speeding up the cellular automata synchronization

In recent years we have seen many generalizations of the well-known Firing Square Synchronization problem. Now it is possible to synchronize networks of finite automata arbitrarily connected. This paper shows a general principle according to which synchronization time of figures with particular symmetry properties will decrease considerably.