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

DOI10.1007/978-3-540-74593-8_25MaRDI QIDQ3608491zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• A Small Five-State Non-Optimum-Time Solution to the Firing Squad Synchronization Problem
• A family of smallest symmetrical four-state firing squad synchronization protocols for ring arrays
• A six-state minimal time solution to the Firing squad synchronization problem
• scientific article; zbMATH DE number 3990874
• Seven-state solutions to the firing squad synchronization problem

Cited in

(9)

• Seven-state solutions to the firing squad synchronization problem
• The smallest FSSP partial solutions for one-dimensional ring cellular automata: symmetric and asymmetric synchronizers
• A new class of the smallest FSSP partial solutions for 1D rings of length \(n=2^k-1\)
• About 4-States Solutions to the Firing Squad Synchronization Problem
• A Small Five-State Non-Optimum-Time Solution to the Firing Squad Synchronization Problem
• scientific article; zbMATH DE number 3990874 (Why is no real title available?)
• A family of smallest symmetrical four-state firing squad synchronization protocols for ring arrays
• A class of the smallest 4-state FSSP partial solutions for rings -- a survey
• A 4-states algebraic solution to linear cellular automata synchronization

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608491)