The firing squad synchronization problem for a class of polyautomata networks

DOI10.1016/0022-0000(78)90011-9zbMath0392.68043OpenAlexW2055792868MaRDI QIDQ1251898

Kojiro Kobayashi

Publication date: 1978

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(78)90011-9

zbMATH Keywords

Dynamical Behaviour of Cellular AutomataFiring Squad SynchronizationPolyautomata Networks

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (14)

An Adaptive Algorithm for P System Synchronization ⋮ On optimal solutions to the firing squad synchronization problem ⋮ Bounding the firing synchronization problem on a ring ⋮ Revisiting the cutting of the firing squad synchronization ⋮ The firing squad synchronization problem for graphs ⋮ An intrinsically non minimal-time Minsky-like 6-states solution to the Firing Squad synchronization problem ⋮ The wake up and report problem is time-equivalent to the firing squad synchronization problem ⋮ 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 ⋮ Near-optimal radio use for wireless network synchronization ⋮ On the minimal firing time of the firing squad synchronization problem for polyautomata networks ⋮ Smaller solutions for the firing squad

Cites Work

• Cellular automata synchronization
• An 8-state minimal time solution to the firing squad synchronization problem
• An optimum solution to the firing squad synchronization problem
• Cellular automata complexity trade-offs
• Unnamed Item
• Unnamed Item

This page was built for publication: The firing squad synchronization problem for a class of polyautomata networks