Akira Nomura

Learn More
The firing squad synchronization problem (FSSP, for short) on cellular automata has been studied extensively for more than fifty years, and a rich variety of synchronization algorithms have been proposed for one-and two-dimensional cellular automata. In the present paper, we propose a new optimum-time FSSP algorithm for two-dimensional square cellular(More)
The firing squad synchronization problem (FSSP, for short) on cellular automata has been studied extensively for more than fifty years, and a rich variety of synchronization algorithms have been proposed for one- and two-dimensional cellular automata. In the present paper, we propose a new optimum-time FSSP algorithm for two-dimensional square cellular(More)
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. In this paper, we propose two synchronization algorithms and their implementations, each having O(n^2) and O(2^n) synchronization steps for n cells, respectively.
  • 1