A design of generalized minimum-state-change FSSP algorithms and their implementations

DOI10.1007/s11047-017-9625-2zbMath1528.68245OpenAlexW2705807050MaRDI QIDQ6062008

Keisuke Imai, Akihiro Sousa, Hiroshi Umeo

Publication date: 30 November 2023

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-017-9625-2

zbMATH Keywords

firing squad synchronization problemcellular automatonFSSPstate-change complexity

Mathematics Subject Classification ID

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

Cites Work

• Some remarks about the efficiency of polyautomata
• 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
• A new reconstruction and the first implementation of Goto's FSSP algorithm
• An 8-state minimal time solution to the firing squad synchronization problem
• An optimum solution to the firing squad synchronization problem
• An intrinsically non minimal-time Minsky-like 6-states solution to the Firing Squad synchronization problem
• A generalized firing squad problem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A design of generalized minimum-state-change FSSP algorithms and their implementations