The Firing Squad Synchronization Problem on Higher-Dimensional CA with Multiple Updating Cycles

Abstract

Traditional cellular automata (CA) assume the presence of a single global clock regulating the update of all their cells. When this assumption is dropped, cells can update with different speeds, thus increasing the difficulty of solving synchronization problems. Here we solve the traditional and the generalized Firing Squad Synchronization Problem in dimension two and higher on multiple updating cycle CA.