An optimum solution to the firing squad synchronization problem
From MaRDI portal
Publication:3445268
DOI10.1016/S0019-9958(66)90110-0zbMath1111.68527OpenAlexW2064819339MaRDI QIDQ3445268
Publication date: 11 June 2007
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(66)90110-0
Related Items
An Adaptive Algorithm for P System Synchronization ⋮ One-dimensional pattern generation by cellular automata ⋮ THE FIRING SQUAD SYNCHRONIZATION PROBLEM ON SQUARES, TORUSES AND RINGS ⋮ Seven-state solutions to the firing squad synchronization problem ⋮ Synchronization of 1-way connected processors ⋮ A six-state minimal time solution to the Firing squad synchronization problem ⋮ On optimal solutions to the firing squad synchronization problem ⋮ Variations of the firing squad problem and applications ⋮ Some remarks about the efficiency of polyautomata ⋮ Bounding the firing synchronization problem on a ring ⋮ Cutting the Firing Squad Synchronization ⋮ Unnamed Item ⋮ Synchronization of interacting automata ⋮ Minimum and non-Minimum Time Solutions to the Firing Squad Synchronization Problem ⋮ Time-Optimum Smaller-State Synchronizers for Cellular Automata ⋮ A design of generalized minimum-state-change FSSP algorithms and their implementations ⋮ Revisiting the cutting of the firing squad synchronization ⋮ A new reconstruction and the first implementation of Goto's FSSP algorithm ⋮ State-efficient realization of fault-tolerant FSSP algorithms ⋮ The firing squad synchronization problem for graphs ⋮ An intrinsically non minimal-time Minsky-like 6-states solution to the Firing Squad synchronization problem ⋮ A class of time-optimum FSSP algorithms for multi-dimensional cellular arrays ⋮ About 4-States Solutions to the Firing Squad Synchronization Problem ⋮ The firing squad synchronization problem on CA with multiple updating cycles ⋮ A Compositional Approach to Synchronize Two Dimensional Networks of Processors ⋮ An efficient solution of the firing mob problem ⋮ One-dimensional pattern generation by cellular automata ⋮ Firing squad synchronization problem in reversible cellular automata ⋮ A linear speed-up theorem for cellular automata ⋮ Abstract geometrical computation. 11: Slanted firing squad synchronisation on signal machines ⋮ The minimum firing time of the generalized firing squad synchronization problem for squares ⋮ A 4-states algebraic solution to linear cellular automata synchronization ⋮ Faster synchronization in P systems ⋮ Cellular automata synchronization ⋮ On the fast synchronization of tree connected networks ⋮ Constructible functions in cellular automata and their applications to hierarchy results ⋮ The firing squad synchronization problem for a class of polyautomata networks ⋮ (A-)synchronous (non)-deterministic cell spaces simulating each other ⋮ On the minimal firing time of the firing squad synchronization problem for polyautomata networks ⋮ A new class of the smallest FSSP partial solutions for 1D rings of length \(n=2^k-1\) ⋮ A New Optimum-Time Firing Squad Synchronization Algorithm for Two-Dimensional Rectangle Arrays: One-Sided Recursive Halving Based ⋮ Computations on one-dimensional cellular automata ⋮ Simple 8-state minimal time solution to the firing squad synchronization problem ⋮ Signals in one-dimensional cellular automata ⋮ Some regular state sets in the system of one-dimensional iterative automata ⋮ Real-time language recognition by one-dimensional cellular automata ⋮ Error detection and correction in firing squad synchronization problem ⋮ Network structure and the firing squad synchronization problem ⋮ Different time solutions for the firing squad synchronization problem on basic grid networks ⋮ A universal cellular automaton in quasi-linear time and its S-m-n form ⋮ Synchronizing square arrays in optimum-time ⋮ The firing squad synchronization problem with sub-generals ⋮ Smaller solutions for the firing squad
