State-Efficient Firing Squad Synchronization Protocols for Communication-Restricted Cellular Automata

DOI10.1007/11861201_22MaRDI QIDQ3539991zbMATH OpenOpenAlexFDO

Authors Takashi Yanagihara, Masaru Kanazawa, Hiroshi Umeo

Publication date 20 November 2008

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

Full work available at URL https://doi.org/10.1007/11861201_22

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Recommendations

• scientific article; zbMATH DE number 2009869
• scientific article; zbMATH DE number 5190413
• scientific article; zbMATH DE number 1738668
• 1-bit inter-cell communication cellular algorithms.
• A Small Five-State Non-Optimum-Time Solution to the Firing Squad Synchronization Problem

Cited in

(3)

• Dealing with final state sensitivity for synchronous communication
• scientific article; zbMATH DE number 5117093 (Why is no real title available?)
• scientific article; zbMATH DE number 2009869 (Why is no real title available?)

This page was built for publication: State-Efficient Firing Squad Synchronization Protocols for Communication-Restricted Cellular Automata

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