Abstract
The firing squad synchronization problem on cellular automata has been studied extensively for more than forty years, and a rich variety of synchronization algorithms have been proposed so far. In the present paper, we propose a new optimum-time algorithm for synchronizing two-dimensional cellular automata. The algorithm can synchronize any rectangular array of size m × n in optimum m + n + max(m, n) -3 steps. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Umeo, H., & Uchino, H. (2007). A new time-optimum synchronization algorithm for two-dimensional cellular arrays. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4739 LNCS, pp. 604–611). Springer Verlag. https://doi.org/10.1007/978-3-540-75867-9_76
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
