Synchronization of a bounded degree graph of cellular automata with nonuniform delays in time \(D\lfloor \log_mD\rfloor\)

DOI10.1016/j.tcs.2006.01.032zbMath1161.68603OpenAlexW2050710223MaRDI QIDQ2490817

Serge Grigorieff

Publication date: 18 May 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.01.032

zbMATH Keywords

cellular automatasynchronization

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15)

Related Items (3)

An intrinsically non minimal-time Minsky-like 6-states solution to the Firing Squad synchronization problem ⋮ Vertex cover problem parameterized above and below tight bounds ⋮ Preface

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The synchronization of nonuniform networks of finite automata
• A QUASI-OPTIMAL TIME FOR SYNCHRONIZING TWO INTERACTING FINITE AUTOMATA

This page was built for publication: Synchronization of a bounded degree graph of cellular automata with nonuniform delays in time \(D\lfloor \log_mD\rfloor\)