Simple 8-state minimal time solution to the firing squad synchronization problem
From MaRDI portal
Recommendations
- An 8-state minimal time solution to the firing squad synchronization problem
- A six-state minimal time solution to the Firing squad synchronization problem
- scientific article; zbMATH DE number 3990874
- Smaller solutions for the firing squad
- An optimum solution to the firing squad synchronization problem
Cites work
Cited in
(12)- An 8-state minimal time solution to the firing squad synchronization problem
- Smaller solutions for the firing squad
- A six-state minimal time solution to the Firing squad synchronization problem
- Generalized FSSP on hexagonal tiling: towards arbitrary regular spaces
- An intrinsically non minimal-time Minsky-like 6-states solution to the Firing Squad synchronization problem
- A survey of cellular automata: types, dynamics, non-uniformity and applications
- An optimum solution to the firing squad synchronization problem
- Simple New Algorithms Which Solve the Firing Squad Synchronization Problem: A 7-States 4n-Steps Solution
- A spatio-temporal algorithmic point of view on firing squad synchronisation problem
- An Investigation into Transition Rule Sets for Optimum-time Firing Squad Synchronization Algorithms on One-dimensional Cellular Automata
- A single-copy minimal-time simulation of a torus of automata by a ring of automata
- scientific article; zbMATH DE number 3990874 (Why is no real title available?)
This page was built for publication: Simple 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 Q1826636)