An 8-state minimal time solution to the firing squad synchronization problem
From MaRDI portal
Publication:2832036
DOI10.1016/S0019-9958(67)90032-0zbMath1347.68249MaRDI QIDQ2832036
Publication date: 4 November 2016
Published in: Information and Control (Search for Journal in Brave)
Related Items
An Adaptive Algorithm for P System Synchronization ⋮ 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 ⋮ Recognition of graphs by automata ⋮ A six-state minimal time solution to the Firing squad synchronization problem ⋮ On optimal solutions to the firing squad synchronization problem ⋮ Automated theorem proving in mathematics. ⋮ Appendix I. A brief review of cellular automata packages ⋮ Some remarks about the efficiency of polyautomata ⋮ Bounding the firing synchronization problem on a ring ⋮ Synchronization of interacting automata ⋮ Minimum and non-Minimum Time Solutions to the Firing Squad Synchronization Problem ⋮ Time-Optimum Smaller-State Synchronizers for Cellular Automata ⋮ Linear speed-up for cellular automata synchronizers and applications ⋮ Conjunctive and Boolean grammars: the true general case of the context-free grammars ⋮ 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 ⋮ Models for cellular interactions in development without polarity of individual cells II. Problems of synchronization and regulation ⋮ 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 ⋮ Time-optimal solution of the firing-squad-synchronization-problem for n- dimensional rectangles with the general at an arbitrary position ⋮ 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 ⋮ Firing squad synchronization problem in reversible cellular automata ⋮ The synchronization of nonuniform networks of finite automata ⋮ A linear speed-up theorem for cellular automata ⋮ 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 ⋮ A Seven-State Time-Optimum Square Synchronizer ⋮ Nonterminals versus homomorphisms in defining languages for some classes of rewriting systems ⋮ On 'forgetful' cellular automata ⋮ Deterministic Lindenmayer languages, nonterminals and homomorphisms ⋮ Cellular automata synchronization ⋮ The firing squad synchronization problem on Cayley graphs ⋮ On the fast synchronization of tree connected networks ⋮ Constructible functions in cellular automata and their applications to hierarchy results ⋮ Leader election on two-dimensional periodic cellular automata ⋮ The firing squad synchronization problem for a class of 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 ⋮ Parallel turing machines with one-head control units and cellular automata ⋮ Signals in one-dimensional cellular automata ⋮ Generalized FSSP on Hexagonal Tiling: Towards Arbitrary Regular Spaces ⋮ 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 ⋮ Parallel recognition of rational languages in plane cellular automata ⋮ The firing squad synchronization problem with sub-generals ⋮ Smaller solutions for the firing squad
