An Efficient Mapping Scheme for Embedding Any One-Dimensional Firing Squad Synchronization Algorithm onto Two-Dimensional Arrays - Cellular Automata - page 81

19. H. Umeo, T. Sogabe and Y. Nomura: Correction, optimization and verification of
transition rule set for Waksman's firing squad synchronization algorithms. Proc. of
the 4th International Conference on Cellular Automata for Research and Industry ,
2000, pp. 152-160.
20. H. Umeo, M. Maeda and N. Fujiwara: Some implementations on two-dimensional
firing squad synchronization algorithms. Proc. of 2001 Summer Language and Au-
tomata Symposium , held on 23-25, July 2001, 2001, pp. 26:1-2.
21. V. I. Varshavsky: Synchronization of a collection of automata with random pairwise
interaction. Autom. and Remote Control , vol. 29(1969), pp. 224-228.
22. V. I. Varshavsky, V. B. Marakhovsky and V. A. Peschansky: Synchronization of
interacting automata. Mathematical Systems Theory , Vol. 4, No. 3(1970), pp. 212-
230.
23. R. Vollmar: Algorithmen in Zellularautomaten . Teubner, pp. 192, 1979.
24. A. Waksman: An optimum solution to the firing squad synchronization problem.
Information and Control , vol. 9(1966), pp. 66-78.
25. J. B. Yunes: Seven state solutions to the firing squad synchronization problem.
Theoretical Computer Science , vol.127(1994), pp. 313-332.