About 4-States Solutions to the Firing Squad Synchronization Problem

DOI10.1007/978-3-540-79992-4_14zbMath1159.68510OpenAlexW1866722109MaRDI QIDQ3541749

Jean-Baptiste Yunès, Naoki Kamikawa, Hiroshi Umeo

Publication date: 27 November 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79992-4_14

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (1)

A 4-states algebraic solution to linear cellular automata synchronization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A 4-states algebraic solution to linear cellular automata synchronization
• A six-state minimal time solution to the Firing squad synchronization problem
• Seven-state solutions to the firing squad synchronization problem
• Smaller solutions for the firing squad
• An 8-state minimal time solution to the firing squad synchronization problem
• An optimum solution to the firing squad synchronization problem
• An intrinsically non minimal-time Minsky-like 6-states solution to the Firing Squad synchronization problem
• A Design of Symmetrical Six-State 3n-Step Firing Squad Synchronization Algorithms and Their Implementations
• A Smallest Five-State Solution to the Firing Squad Synchronization Problem

This page was built for publication: About 4-States Solutions to the Firing Squad Synchronization Problem