A six-state minimal time solution to the firing squad synchronization problem
Theoretical Computer Science
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
A new time-optimum synchronization algorithm for two-dimensional cellular arrays
EUROCAST'07 Proceedings of the 11th international conference on Computer aided systems theory
UC'05 Proceedings of the 4th international conference on Unconventional Computation
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
A seven-state time-optimum square synchronizer
ACRI'10 Proceedings of the 9th international conference on Cellular automata for research and industry
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Hi-index | 0.00 |
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 two-dimensional rectangle array of size m × n in optimum m + n + max(m, n) − 3 steps. A partial implementation of the algorithm for small cellular arrays is also given.