The firing squad synchronization problem on CA with multiple updating cycles
From MaRDI portal
Publication:475400
DOI10.1016/J.TCS.2014.08.011zbMATH Open1360.68616OpenAlexW2044446447MaRDI QIDQ475400FDOQ475400
Authors: Luca Manzoni, Hiroshi Umeo 
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
Recommendations
Cites Work
- An experimental study of robustness to asynchronism for elementary cellular automata
- Title not available (Why is that?)
- Fully asynchronous behavior of double-quiescent elementary cellular automata
- Asynchronous cellular automata and dynamical properties
- \(m\)-asynchronous cellular automata: from fairness to quasi-fairness
- Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata
- Probabilistic cellular automata with conserved quantities
- An 8-state minimal time solution to the firing squad synchronization problem
- 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
- Title not available (Why is that?)
- An optimum solution to the firing squad synchronization problem
- Two- and three-dimensional firing-squad synchronization problems
- Synchronization of cellular arrays: The firing squad problem in two dimensions
- Title not available (Why is that?)
- Fault tolerant solutions to the firing squad synchronization problem in linear cellular automata
- A generalized firing squad problem
- Title not available (Why is that?)
- Synchronization of interacting automata
Cited In (8)
- Title not available (Why is that?)
- Remarks on the cellular automaton global synchronisation problem: deterministic versus stochastic models
- Cellular Automata Pseudo-Random Number Generators and Their Resistance to Asynchrony
- Remarks on the cellular automaton global synchronisation problem
- Title not available (Why is that?)
- A faster algorithm for the birthday song singers synchronization problem (FSSP) in one-dimensional CA with multiple speeds
- An asynchronous solution to the synchronisation problem for binary one-dimensional cellular automata
- A survey of cellular automata: types, dynamics, non-uniformity and applications
This page was built for publication: The firing squad synchronization problem on CA with multiple updating cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q475400)
