\(m\)-asynchronous cellular automata: from fairness to quasi-fairness
From MaRDI portal
Publication:269781
DOI10.1007/s11047-013-9386-5zbMath1333.68191OpenAlexW2065437207WikidataQ57518433 ScholiaQ57518433MaRDI QIDQ269781
Alberto Dennunzio, Giancarlo Mauri, Enrico Formenti, Luca Manzoni
Publication date: 6 April 2016
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11047-013-9386-5
Related Items
Towards intrinsically universal asynchronous CA, \(m\)-asynchronous cellular automata: from fairness to quasi-fairness, Computation of functions on \(n\) bits by asynchronous clocking of cellular automata, Synchronous cellular automata-based scheduler initialized by heuristic and modeled by a pseudo-linear neighborhood, Non-maximal sensitivity to synchronism in elementary cellular automata: exact asymptotic measures, Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues, Complexity of the dynamics of reaction systems, The impact of alphabet size on pattern complexity of maxmin-\( \omega\) cellular automata, Attractor landscapes in Boolean networks with firing memory: a theoretical study applied to genetic networks, A survey of cellular automata: types, dynamics, non-uniformity and applications, Cellular Automata Pseudo-Random Number Generators and Their Resistance to Asynchrony, CLOUDS IN THE BASINS OF FULLY ASYNCHRONOUS CELLULAR AUTOMATA, Topological dynamics of nondeterministic cellular automata, Fixing monotone Boolean networks asynchronously, On the dynamical behaviour of linear higher-order cellular automata and its decidability, Three research directions in non-uniform cellular automata, The firing squad synchronization problem on CA with multiple updating cycles, Computational complexity of finite asynchronous cellular automata, Local structure approximation as a predictor of second-order phase transitions in asynchronous cellular automata, Supercritical probabilistic cellular automata: how effective is the synchronous updating?, Turing-completeness of asynchronous non-camouflage cellular automata
Cites Work
- \(m\)-asynchronous cellular automata: from fairness to quasi-fairness
- Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues
- Local rule distributions, language complexity and non-uniform cellular automata
- Non-uniform cellular automata: classes, dynamics, and decidability
- Some results about the chaotic behavior of cellular automata
- Conservation of some dynamical properties for operations on cellular automata
- Sand automata as cellular automata
- On the directional dynamics of additive cellular automata
- Progresses in the analysis of stochastic 2D cellular automata: a study of asynchronous 2D minority
- Reversibility and surjectivity problems of cellular automata
- Synchronous versus asynchronous dynamics in spatially distributed systems
- Delay-insensitive computation in asynchronous cellular automata
- Solution of some conjectures about topological properties of linear cellular automata
- Surjective multidimensional cellular automata are non-wandering: a combinatorial proof
- Fully asynchronous behavior of double-quiescent elementary cellular automata
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
- Asynchronous cellular automata and dynamical properties
- Order Independence in Asynchronous Cellular Automata
- Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata
- Decidable Properties of 2D Cellular Automata
- A Full Cellular Automaton to Simulate Predator-Prey Systems
- Non-uniform Cellular Automata
- Probabilistic cellular automata with conserved quantities
- Computing Issues of Asynchronous CA
- Endomorphisms and automorphisms of the shift dynamical system
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
