An intrinsically non minimal-time Minsky-like 6-states solution to the Firing Squad synchronization problem

DOI10.1051/ITA:2007051MaRDI QIDQ3514634zbMATH OpenOpenAlexFDO

Authors Jean-Baptiste Yunès

Publication date 21 July 2008

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL http://www.numdam.org/item?id=ITA_2008__42_1_55_0/, https://eudml.org/doc/92863

zbMATH Keywords

firing squad synchronization

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Recommendations

• scientific article; zbMATH DE number 3990874
• An 8-state minimal time solution to the firing squad synchronization problem
• A six-state minimal time solution to the Firing squad synchronization problem
• Seven-state solutions to the firing squad synchronization problem
• Simple New Algorithms Which Solve the Firing Squad Synchronization Problem: A 7-States 4n-Steps Solution

Cites work

• A Design of Symmetrical Six-State 3n-Step Firing Squad Synchronization Algorithms and Their Implementations
• A six-state minimal time solution 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
• Cellular automata synchronization
• Fault tolerant solutions to the firing squad synchronization problem in linear cellular automata
• scientific article; zbMATH DE number 2016494 (Why is no real title available?)
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• scientific article; zbMATH DE number 3419059 (Why is no real title available?)
• Seven-state solutions to the firing squad synchronization problem
• Simple 8-state minimal time solution to the firing squad synchronization problem
• Smaller solutions for the firing squad
• Synchronization of a bounded degree graph of cellular automata with nonuniform delays in time \(D\lfloor \log_mD\rfloor\)
• The firing squad synchronization problem for a class of polyautomata networks
• The firing squad synchronization problem on Cayley graphs
• The synchronization of nonuniform networks of finite automata
• Time-optimal solution of the firing-squad-synchronization-problem for n- dimensional rectangles with the general at an arbitrary position
• Two- and three-dimensional firing-squad synchronization problems

Cited in

(9)

• A six-state minimal time solution to the Firing squad synchronization problem
• Seven-state solutions to the firing squad synchronization problem
• An 8-state minimal time solution to the firing squad synchronization problem
• About 4-States Solutions to the Firing Squad Synchronization Problem
• Simple New Algorithms Which Solve the Firing Squad Synchronization Problem: A 7-States 4n-Steps Solution
• scientific article; zbMATH DE number 3990874 (Why is no real title available?)
• Bounding the firing synchronization problem on a ring
• A design of generalized minimum-state-change FSSP algorithms and their implementations
• A 4-states algebraic solution to linear cellular automata synchronization

This page was built for publication: An intrinsically non minimal-time Minsky-like 6-states solution to the Firing Squad synchronization problem

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