THE FIRING SQUAD SYNCHRONIZATION PROBLEM ON SQUARES, TORUSES AND RINGS

DOI10.1142/S0129054107004875zbMath1117.68049MaRDI QIDQ3444850

Salvatore La Torre, Jozef Gruska

Publication date: 5 June 2007

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

cellular automataringsinterconnection networksarraysfiring squad synchronization problemtoruses

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items

Advances on Random Sequence Generation by Uniform Cellular Automata, Minimum and non-Minimum Time Solutions to the Firing Squad Synchronization Problem, Time-Optimum Smaller-State Synchronizers for Cellular Automata, Synchronizing square arrays in optimum-time

Cites Work

• Unnamed Item
• Firing squad synchronization problem in reversible cellular automata
• A six-state minimal time solution to the Firing squad synchronization problem
• Time-optimal solution of the firing-squad-synchronization-problem for n- dimensional rectangles with the general at an arbitrary position
• On optimal solutions 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
• Two- and three-dimensional firing-squad synchronization problems