A six-state minimal time solution to the firing squad synchronization problem
Theoretical Computer Science
Seven-state solutions to the Firing Squad Synchronization Problem
Theoretical Computer Science
MFCS '92 Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science
Non-Minimal Time Solutions for the Firing Sychronization Problem
Non-Minimal Time Solutions for the Firing Sychronization Problem
Computation: finite and infinite machines
Computation: finite and infinite machines
A smallest five-state solution to the firing squad synchronization problem
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
ACRI'06 Proceedings of the 7th international conference on Cellular Automata for Research and Industry
About 4-States Solutions to the Firing Squad Synchronization Problem
ACRI '08 Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry
Simulation of generalized synchronization processes on one-dimensional cellular automata
SMO'09 Proceedings of the 9th WSEAS international conference on Simulation, modelling and optimization
Fundamenta Informaticae - Machines, Computations and Universality, Part I
| Hi-index | 0.89 |
In this paper, we aim to present a completely new solution to the firing squad synchronization problem based on Wolfram's rule 60. This solution solves the problem on an infinite number of lines but not all possible lines. The two remarkable properties are that the state complexity of it is the lowest possible, say 4 states and 32 transitions (we prove that no line of length n=5 can be synchronized with only 3 states) and that the algorithm is no more based on geometric constructions but relies on some algebraic properties of the transition function. The solution is almost in minimal time: up to one unit of time.