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

DOI10.4036/IIS.2002.207zbMATH Open1050.68102OpenAlexW2014876070MaRDI QIDQ4800323FDOQ4800323

Authors Masaya Hisaoka, Takashi Sogabe, 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)

Recommendations

• scientific article; zbMATH DE number 2040823
• An optimum-time firing squad synchronization algorithm for two-dimensional rectangle arrays
• How to synchronize cellular automata -- recent developments
• Synchronizing square arrays in optimum-time
• Simple 8-state minimal time solution to the firing squad synchronization problem

Cited in

(5)

• Minimum and non-minimum time solutions to the firing squad synchronization problem
• scientific article; zbMATH DE number 2040823 (Why is no real title available?)
• A Comparative Study of Optimum-Time Synchronization Algorithms for One-Dimensional Cellular Automata – A Survey –
• 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

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