Smaller solutions for the firing squad

DOI10.1016/S0304-3975(01)00191-8zbMath1002.68096WikidataQ56814207 ScholiaQ56814207MaRDI QIDQ1605305

Janos Simon, Amber Settle

Publication date: 15 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

cellular automatafinite automatafiring squad synchronization problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Cellular automata (computational aspects) (68Q80)

Related Items (7)

Bounding the firing synchronization problem on a ring ⋮ Time-Optimum Smaller-State Synchronizers for Cellular Automata ⋮ An intrinsically non minimal-time Minsky-like 6-states solution to the Firing Squad synchronization problem ⋮ About 4-States Solutions to the Firing Squad Synchronization Problem ⋮ The minimum firing time of the generalized firing squad synchronization problem for squares ⋮ A 4-states algebraic solution to linear cellular automata synchronization ⋮ Generalized FSSP on Hexagonal Tiling: Towards Arbitrary Regular Spaces

Cites Work

• A six-state minimal time solution to the Firing squad synchronization problem
• Variations of the firing squad problem and applications
• The firing squad synchronization problem for graphs
• Time-optimal solution of the firing-squad-synchronization-problem for n- dimensional rectangles with the general at an arbitrary position
• The firing squad synchronization problem for a class of polyautomata networks
• Seven-state 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
• Computing with Snakes in Directed Networks of Automata
• Faster computation on directed networks of automata
• A generalized firing squad problem
• Synchronization of interacting automata
• Unnamed Item
• Unnamed Item

This page was built for publication: Smaller solutions for the firing squad