Nonexistence of minimal-time solutions for some variations of the firing squad synchronization problem having simple geometric configurations

MaRDI QIDQ5010338zbMATH OpenFDO

Authors Kojiro Kobayashi

Publication date 25 August 2021

Full work available at URL https://arxiv.org/abs/1909.10125, https://www.oldcitypublishing.com/journals/jca-home/jca-issue-contents/jca-volume-14-number-5-6-2019/jca-14-5-6-p-351-396/

zbMATH Keywords

distributed computingcellular automatafiring squad synchronization problemnonexistence proofoptimal-time solutionsub-general

Mathematics Subject Classification ID

Dynamical aspects of cellular automata (37B15) Cellular automata (computational aspects) (68Q80)

Recommendations

• The minimum firing time of the generalized firing squad synchronization problem for squares
• Developments in Language Theory
• On optimal solutions to the firing squad synchronization problem
• The firing squad synchronization problem with sub-generals
• Minimum and non-minimum time solutions to the firing squad synchronization problem

Cited in

(2)

• The minimum firing time of the generalized firing squad synchronization problem for squares
• A Small Five-State Non-Optimum-Time Solution to the Firing Squad Synchronization Problem

This page was built for publication: Nonexistence of minimal-time solutions for some variations of the firing squad synchronization problem having simple geometric configurations

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