Seven-state solutions to the firing squad synchronization problem
From MaRDI portal
Publication:1342240
DOI10.1016/0304-3975(94)90045-0zbMath0938.68736OpenAlexW1988370387MaRDI QIDQ1342240
Publication date: 21 June 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)90045-0
Related Items (12)
On optimal solutions to the firing squad synchronization problem ⋮ Linear speed-up for cellular automata synchronizers and applications ⋮ 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 ⋮ HOW TO SYNCHRONIZE THE ACTIVITY OF ALL COMPONENTS OF A P SYSTEM? ⋮ Firing squad synchronization problem in reversible 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 ⋮ Upper bound on the products of particle interactions in cellular automata ⋮ Fast Synchronization in P Systems ⋮ Constructible functions in cellular automata and their applications to hierarchy results ⋮ Smaller solutions for the firing squad
Cites Work
- Unnamed Item
- A six-state minimal time solution to the Firing squad synchronization problem
- An 8-state minimal time solution to the firing squad synchronization problem
- An optimum solution to the firing squad synchronization problem
- A generalized firing squad problem
- Generation of Primes by a One-Dimensional Real-Time Iterative Array
This page was built for publication: Seven-state solutions to the firing squad synchronization problem
