Simple New Algorithms Which Solve the Firing Squad Synchronization Problem: A 7-States 4n-Steps Solution

DOI10.1007/978-3-540-74593-8_27zbMath1211.68264OpenAlexW1542766538MaRDI QIDQ3608493

Jean-Baptiste Yunès

Publication date: 5 March 2009

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-74593-8_27

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (3)

Exact Discretization of 3-Speed Rational Signal Machines into Cellular Automata ⋮ Abstract geometrical computation. 11: Slanted firing squad synchronisation on signal machines ⋮ The minimum firing time of the generalized firing squad synchronization problem for squares

This page was built for publication: Simple New Algorithms Which Solve the Firing Squad Synchronization Problem: A 7-States 4n-Steps Solution