A six-state minimal time solution to the Firing squad synchronization problem
The firing squad synchronization problem is the problem of synchronization of n finite state automata connected in the structure of a one-dimensional systolic array. The time-optimal solution with eight states was presented by \textit{R. Balzar} [An 8-states minimal time solution to the firing squad synchronization problem, Inf. Control 10, 22-42 (1967)]. Using a new method the author gives a new time-optimal solution with six states only. An open problem remains whether this number can be decreased to 5 (at least five states are necessary).
scientific article; zbMATH DE number 4035143