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

DOI10.1016/0304-3975(78)90046-4MaRDI QIDQ1253922zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• An optimum solution to the firing squad synchronization problem
• Cellular automata synchronization
• scientific article; zbMATH DE number 3305051 (Why is no real title available?)
• scientific article; zbMATH DE number 3419059 (Why is no real title available?)
• The firing squad synchronization problem for a class of polyautomata networks
• The firing squad synchronization problem for two-dimensional arrays

Cited in

(6)

• 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
• Revisiting the cutting of the firing squad synchronization

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

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