Abstract
The firing squad synchronization problem on cellular automata has been studied extensively for more than 50 years, and a rich variety of synchronization algorithms have been proposed for not only one-dimensional (1D) arrays but also 2D arrays. In this paper, we construct a survey on a design and implementation of optimum-time synchronization algorithms for 2D square arrays.
Acknowledgement
A part of this work has been supported by Grant-in-Aid for Scientific Research (C) 21500023.