A Comparative Study of Optimum-Time Synchronization Algorithms for One-Dimensional Cellular Automata – A Survey –

DOI10.1007/978-3-540-30479-1_6MaRDI QIDQ5464136zbMATH OpenOpenAlexFDO

Authors Masaya Hisaoka, Takashi Sogabe, Hiroshi Umeo

Publication date 17 August 2005

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-30479-1_6

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Recommendations

• scientific article; zbMATH DE number 2040823
• An Investigation into Transition Rule Sets for Optimum-time Firing Squad Synchronization Algorithms on One-dimensional Cellular Automata
• Synchronizing square arrays in optimum-time
• A new time-optimum synchronization algorithm for rectangle arrays
• How to synchronize cellular automata -- recent developments

Cited in

(1)

• scientific article; zbMATH DE number 2040823 (Why is no real title available?)

This page was built for publication: A Comparative Study of Optimum-Time Synchronization Algorithms for One-Dimensional Cellular Automata – A Survey –

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