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

DOI10.1007/978-3-540-30479-1_6zbMATH Open1116.68535OpenAlexW1538873872MaRDI QIDQ5464136FDOQ5464136

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

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

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Cited In (1)

• Title not available (Why is that?)

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)