Abstract
The firing squad synchronization problem (FSSP) on cellular automata has been studied extensively for more than fifty years, and a rich variety of synchronization algorithms have been proposed. In the present paper, we focus our attention to two-dimensional square synchronizers that can synchronize square arrays and construct a survey on recent developments in their designs and implementations of optimum-time synchronization algorithms for square arrays. A new generalized square synchronization algorithm with an initial general at any position is also presented. © 2012 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Umeo, H., & Kubo, K. (2012). Recent developments in constructing square synchronizers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7495 LNCS, pp. 171–183). Springer Verlag. https://doi.org/10.1007/978-3-642-33350-7_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
