Simple 8-state minimal time solution to the firing squad synchronization problem

Authors:
Kenichiro Noguchi
Affiliations:
Department of Information and Computer Science, Kanagawa University, 2946 Tsuchiya Hiratsuka-shi, Kanagawa 259-1293, Japan
Venue:
Theoretical Computer Science
Year:
2004

Citing 3
Cited 1

A six-state minimal time solution to the firing squad synchronization problem

Theoretical Computer Science
On optimal solutions to the firing squad synchronization problem

Theoretical Computer Science - Special issue on universal machines and computations
Correction, Optimization and Verification of Transition Rule Set for Waksman's Firing Squad Synchronization Algorithm

Proceedings of the Fourth International Conference on Cellular Automata for Research and Industry: Theoretical and Practical Issues on Cellular Automata

A single-copy minimal-time simulation of a torus of automata by a ring of automata

Discrete Applied Mathematics

Quantified Score

Hi-index	5.23

Visualization

Abstract

The objective of the firing squad synchronization problem is to define sets of states and transition rules of a finite-state machine so that a one-dimensional array of such machines work synchronously. A minimal time solution to this problem was first found by Goto in 1961. Thereafter, other minimal time solutions were reported. I studied this problem and found an 8-state 119-rule solution by using a simple algorithm. The number of rules is much less than in Baltzer's 8-state solution and the same as in Mazoyer's 6-state solution.