A Smallest Five-State Solution to the Firing Squad Synchronization Problem

DOI10.1007/978-3-540-74593-8_25zbMath1159.68509OpenAlexW1553595589MaRDI QIDQ3608491

Takashi Yanagihara, Hiroshi Umeo

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_25

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (3)

About 4-States Solutions to the Firing Squad Synchronization Problem ⋮ A 4-states algebraic solution to linear cellular automata synchronization ⋮ A new class of the smallest FSSP partial solutions for 1D rings of length \(n=2^k-1\)

This page was built for publication: A Smallest Five-State Solution to the Firing Squad Synchronization Problem