Simple 8-state minimal time solution to the firing squad synchronization problem

DOI10.1016/S0304-3975(03)00425-0zbMath1072.68071MaRDI QIDQ1826636

Kenichiro Noguchi

Publication date: 6 August 2004

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

zbMATH Keywords

SynchronizationFiring squad synchronization problemCellular automatonFinite-state machine

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (4)

A single-copy minimal-time simulation of a torus of automata by a ring of automata ⋮ A survey of cellular automata: types, dynamics, non-uniformity and applications ⋮ An intrinsically non minimal-time Minsky-like 6-states solution to the Firing Squad synchronization problem ⋮ Generalized FSSP on Hexagonal Tiling: Towards Arbitrary Regular Spaces

Cites Work

• A six-state minimal time solution to the Firing squad synchronization problem
• On optimal solutions to the firing squad synchronization problem
• An 8-state minimal time solution to the firing squad synchronization problem
• An optimum solution to the firing squad synchronization problem

This page was built for publication: Simple 8-state minimal time solution to the firing squad synchronization problem