On the minimal firing time of the firing squad synchronization problem for polyautomata networks

DOI10.1016/0304-3975(78)90046-4zbMath0397.68050OpenAlexW2042455821MaRDI QIDQ1253922

Kojiro Kobayashi

Publication date: 1978

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

Full work available at URL: https://doi.org/10.1016/0304-3975(78)90046-4

zbMATH Keywords

Firing Squad Synchronization Problem For Polyautomata NetworksMinimal Firing Time

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (6)

Revisiting the cutting of the firing squad synchronization ⋮ The firing squad synchronization problem for graphs ⋮ An efficient solution of the firing mob problem ⋮ The synchronization of nonuniform networks of finite automata ⋮ The minimum firing time of the generalized firing squad synchronization problem for squares ⋮ On time optimal solutions of the firing squad synchronization problem for two-dimensional paths

Cites Work

• Cellular automata synchronization
• The firing squad synchronization problem for a class of polyautomata networks
• An optimum solution to the firing squad synchronization problem
• The firing squad synchronization problem for two-dimensional arrays
• Unnamed Item
• Unnamed Item

This page was built for publication: On the minimal firing time of the firing squad synchronization problem for polyautomata networks