Firing squad synchronization problem in reversible cellular automata

DOI10.1016/0304-3975(96)00016-3zbMath0872.68122OpenAlexW1995692031MaRDI QIDQ671532

Kenichi Morita, Katsunobu Imai

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

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (10)

THE FIRING SQUAD SYNCHRONIZATION PROBLEM ON SQUARES, TORUSES AND RINGS ⋮ Real-time reversible iterative arrays ⋮ Revisiting the cutting of the firing squad synchronization ⋮ Reversible computing and cellular automata -- a survey ⋮ A Compositional Approach to Synchronize Two Dimensional Networks of Processors ⋮ Fast reversible language recognition using cellular automata ⋮ Bulking II: Classifications of cellular automata ⋮ Different time solutions for the firing squad synchronization problem on basic grid networks ⋮ Computation in reversible cellular automata ⋮ The firing squad synchronization problem with sub-generals

Cites Work

• Unnamed Item
• A six-state minimal time solution to the Firing squad synchronization problem
• Seven-state solutions to the firing squad synchronization problem
• 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
• The firing squad synchronization problem for two-dimensional arrays

This page was built for publication: Firing squad synchronization problem in reversible cellular automata