Firing squad synchronization problem in reversible cellular automata
From MaRDI portal
Publication:671532
Recommendations
Cites work
- scientific article; zbMATH DE number 3305051 (Why is no real title available?)
- 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
- Seven-state solutions to the firing squad synchronization problem
- Tesselations with local transformations
- The firing squad synchronization problem for two-dimensional arrays
Cited in
(12)- A compositional approach to synchronize two-dimensional networks of processors
- Fast reversible language recognition using cellular automata
- Computation in reversible cellular automata
- scientific article; zbMATH DE number 1886326 (Why is no real title available?)
- Bulking II: Classifications of cellular automata
- Revisiting the cutting of the firing squad synchronization
- Real-time reversible iterative arrays
- Reversible computing and cellular automata -- a survey
- The firing squad synchronization problem with sub-generals
- The complexity of iterated reversible computation
- THE FIRING SQUAD SYNCHRONIZATION PROBLEM ON SQUARES, TORUSES AND RINGS
- Different time solutions for the firing squad synchronization problem on basic grid networks
This page was built for publication: Firing squad synchronization problem in reversible cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q671532)