The firing squad synchronization problem on Cayley graphs

DOI10.1016/S0304-3975(00)00160-2MaRDI QIDQ5915397zbMATH OpenFDO

Authors Zsuzsanna Róka

Publication date 21 August 2000

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

Full work available at URL https://doi.org/10.1016/S0304-3975(00)00160-2

zbMATH Keywords

Cayley graphscellular automataFSSP

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Recommendations

• The firing squad synchronization problem on Cayley graphs
• Minimum and non-minimum time solutions to the firing squad synchronization problem
• scientific article; zbMATH DE number 2163014
• An efficient solution of the firing mob problem
• Smaller solutions for the firing squad

Cites work

• A generalized firing squad problem
• A six-state minimal time solution to the Firing squad synchronization problem
• An 8-state minimal time solution to the firing squad synchronization problem
• Garden of Eden Configurations for Cellular Automata on Cayley Graphs of Groups
• scientific article; zbMATH DE number 3419059 (Why is no real title available?)
• Time-optimal solution of the firing-squad-synchronization-problem for n- dimensional rectangles with the general at an arbitrary position
• Variations of the firing squad problem and applications

Cited in

(3)

• Elements of a theory of computer simulation. I
• An intrinsically non minimal-time Minsky-like 6-states solution to the Firing Squad synchronization problem
• The firing squad synchronization problem on Cayley graphs

This page was built for publication: The firing squad synchronization problem on Cayley graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5915397)