An Investigation into Transition Rule Sets for Optimum-time Firing Squad Synchronization Algorithms on One-dimensional Cellular Automata

DOI10.4036/IIS.2002.207zbMath1050.68102OpenAlexW2014876070MaRDI QIDQ4800323

Takashi Sogabe, Masaya Hisaoka, Hiroshi Umeo

Publication date: 15 July 2003

Published in: Interdisciplinary Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4036/iis.2002.207

zbMATH Keywords

Gerken's algorithmMazoyer's algorithm

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (3)

Minimum and non-Minimum Time Solutions to the Firing Squad Synchronization Problem ⋮ Time-Optimum Smaller-State Synchronizers for Cellular Automata ⋮ A New Optimum-Time Firing Squad Synchronization Algorithm for Two-Dimensional Rectangle Arrays: One-Sided Recursive Halving Based

This page was built for publication: An Investigation into Transition Rule Sets for Optimum-time Firing Squad Synchronization Algorithms on One-dimensional Cellular Automata