The firing squad synchronization problem on CA with multiple updating cycles

DOI10.1016/j.tcs.2014.08.011zbMath1360.68616OpenAlexW2044446447MaRDI QIDQ475400

Hiroshi Umeo, Luca Manzoni

Publication date: 26 November 2014

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

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

zbMATH Keywords

cellular automatafiring squad synchronization problemasynchronicity

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (3)

A survey of cellular automata: types, dynamics, non-uniformity and applications ⋮ Cellular Automata Pseudo-Random Number Generators and Their Resistance to Asynchrony ⋮ A faster algorithm for the Birthday Song Singers synchronization problem (FSSP) in one-dimensional CA with multiple speeds

Cites Work

• \(m\)-asynchronous cellular automata: from fairness to quasi-fairness
• Time-optimal solution of the firing-squad-synchronization-problem for n- dimensional rectangles with the general at an arbitrary position
• On optimal solutions to the firing squad synchronization problem
• Fully asynchronous behavior of double-quiescent elementary cellular automata
• Asynchronous cellular automata and dynamical properties
• An 8-state minimal time solution to the firing squad synchronization problem
• An optimum solution to the firing squad synchronization problem
• Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata
• Two- and three-dimensional firing-squad synchronization problems
• Synchronization of cellular arrays: The firing squad problem in two dimensions
• Probabilistic cellular automata with conserved quantities
• A generalized firing squad problem
• Synchronization of interacting automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The firing squad synchronization problem on CA with multiple updating cycles