A Design of Symmetrical Six-State 3n-Step Firing Squad Synchronization Algorithms and Their Implementations
From MaRDI portal
Publication:3539988
DOI10.1007/11861201_21zbMath1155.68468OpenAlexW1829917434MaRDI QIDQ3539988
Kazuaki Hongyo, Masashi Maeda, 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_21
Related Items (4)
Time-Optimum Smaller-State Synchronizers for Cellular Automata ⋮ An intrinsically non minimal-time Minsky-like 6-states solution to the Firing Squad synchronization problem ⋮ About 4-States Solutions to the Firing Squad Synchronization Problem ⋮ A 4-states algebraic solution to linear cellular automata synchronization
This page was built for publication: A Design of Symmetrical Six-State 3n-Step Firing Squad Synchronization Algorithms and Their Implementations
