Firing squad synchronization problem in reversible cellular automata
From MaRDI portal
Publication:671532
DOI10.1016/0304-3975(96)00016-3zbMATH Open0872.68122OpenAlexW1995692031MaRDI QIDQ671532FDOQ671532
Authors: Katsunobu Imai, Kenichi Morita 
Publication date: 27 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(96)00016-3
Recommendations
Cites Work
- Tesselations with local transformations
- An 8-state minimal time solution to the firing squad synchronization problem
- An optimum solution to the firing squad synchronization problem
- Title not available (Why is that?)
- A six-state minimal time solution to the Firing squad synchronization problem
- Seven-state solutions to the firing squad synchronization problem
- The firing squad synchronization problem for two-dimensional arrays
Cited In (12)
- Title not available (Why is that?)
- A compositional approach to synchronize two-dimensional networks of processors
- Revisiting the cutting of the firing squad synchronization
- Real-time reversible iterative arrays
- The complexity of iterated reversible computation
- Fast reversible language recognition using cellular automata
- Bulking II: Classifications of cellular automata
- Computation in reversible cellular automata
- Reversible computing and cellular automata -- a survey
- The firing squad synchronization problem with sub-generals
- Different time solutions for the firing squad synchronization problem on basic grid networks
- THE FIRING SQUAD SYNCHRONIZATION PROBLEM ON SQUARES, TORUSES AND RINGS
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)
