A Transition Rule Set for the First 2-D Optimum-Time Synchronization Algorithm
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 for two-dimensional cellular arrays. In the present paper, we reconstruct a real-coded transition rule set for an optimum-time synchronization algorithm proposed by Shinahr [11], known as the first optimum-time synchronization algorithm for two-dimensional rectangle arrays. Based on our computer simulation, it is shown that the proposed rule set consists of 28-state, 12849 transition rules and has a validity for the synchronization for any rectangle arrays of size m ×n such that 2 ≤ m, n ≤ 500.
- Publication:
-
Natural Computing, Proceedings in Information and Communications Technology
- Pub Date:
- 2010
- DOI:
- 10.1007/978-4-431-53868-4_38
- Bibcode:
- 2010naco.book..333U