An 8-state minimal time solution to the firing squad synchronization problem
From MaRDI portal
Publication:2832036
DOI10.1016/S0019-9958(67)90032-0zbMATH Open1347.68249MaRDI QIDQ2832036FDOQ2832036
Authors: Robert Balzer 
Publication date: 4 November 2016
Published in: Information and Control (Search for Journal in Brave)
Recommendations
- Simple 8-state minimal time solution to the firing squad synchronization problem
- scientific article; zbMATH DE number 3990874
- A six-state minimal time solution to the Firing squad synchronization problem
- An intrinsically non minimal-time Minsky-like 6-states solution to the Firing Squad synchronization problem
- Seven-state solutions to the firing squad synchronization problem
Cited In (64)
- Unconventional Computation
- On the fast synchronization of tree connected networks
- A 4-states algebraic solution to linear cellular automata synchronization
- A compositional approach to synchronize two-dimensional networks of processors
- Seven-state solutions to the firing squad synchronization problem
- Models for cellular interactions in development without polarity of individual cells II. Problems of synchronization and regulation
- Linear speed-up for cellular automata synchronizers and applications
- Constructible functions in cellular automata and their applications to hierarchy results
- A universal cellular automaton in quasi-linear time and its S-m-n form
- Firing squad synchronization problem in reversible cellular automata
- Time-optimum smaller-state synchronizers for cellular automata
- An optimum solution to the firing squad synchronization problem
- The firing squad synchronization problem on Cayley graphs
- Minimum and non-minimum time solutions to the firing squad synchronization problem
- The firing squad synchronization problem with sub-generals
- Parallel turing machines with one-head control units and cellular automata
- Some remarks about the efficiency of polyautomata
- Conjunctive and Boolean grammars: the true general case of the context-free grammars
- Signals in one-dimensional cellular automata
- Leader election on two-dimensional periodic cellular automata
- Bounding the firing synchronization problem on a ring
- Faster synchronization in P systems
- The minimum firing time of the generalized firing squad synchronization problem for squares
- Appendix I. A brief review of cellular automata packages
- The firing squad synchronization problem for graphs
- Computations on one-dimensional cellular automata
- A six-state minimal time solution to the Firing squad synchronization problem
- A new class of the smallest FSSP partial solutions for 1D rings of length \(n=2^k-1\)
- The firing squad synchronization problem for a class of polyautomata networks
- On minimal-time solutions of firing squad synchronization problems for networks
- Parallel recognition of rational languages in plane cellular automata
- Smaller solutions for the firing squad
- An intrinsically non minimal-time Minsky-like 6-states solution to the Firing Squad synchronization problem
- About 4-States Solutions to the Firing Squad Synchronization Problem
- The firing squad synchronization problem on CA with multiple updating cycles
- A class of time-optimum FSSP algorithms for multi-dimensional cellular arrays
- Synchronization of interacting automata
- THE FIRING SQUAD SYNCHRONIZATION PROBLEM ON SQUARES, TORUSES AND RINGS
- An efficient solution of the firing mob problem
- The synchronization of nonuniform networks of finite automata
- Network structure and the firing squad synchronization problem
- A linear speed-up theorem for cellular automata
- Cellular automata synchronization
- Time-optimal solution of the firing-squad-synchronization-problem for n- dimensional rectangles with the general at an arbitrary position
- Recognition of graphs by automata
- Automated theorem proving in mathematics.
- On optimal solutions to the firing squad synchronization problem
- A new optimum-time firing squad synchronization algorithm for two-dimensional rectangle arrays: one-sided recursive halving based
- A seven-state time-optimum square synchronizer
- Simple 8-state minimal time solution to the firing squad synchronization problem
- Error detection and correction in firing squad synchronization problem
- A new reconstruction and the first implementation of Goto's FSSP algorithm
- Nonterminals versus homomorphisms in defining languages for some classes of rewriting systems
- On 'forgetful' cellular automata
- Deterministic Lindenmayer languages, nonterminals and homomorphisms
- Revisiting the cutting of the firing squad synchronization
- Title not available (Why is that?)
- State-efficient realization of fault-tolerant FSSP algorithms
- A design of generalized minimum-state-change FSSP algorithms and their implementations
- Synchronization of 1-way connected processors
- Different time solutions for the firing squad synchronization problem on basic grid networks
- An adaptive algorithm for P system synchronization
- Synchronizing square arrays in optimum-time
- Generalized FSSP on hexagonal tiling: towards arbitrary regular spaces
This page was built for publication: An 8-state minimal time solution to the firing squad synchronization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2832036)
