Computing issues of asynchronous CA
DOI10.3233/FI-2012-755zbMATH Open1283.68226OpenAlexW1608518359MaRDI QIDQ4902304FDOQ4902304
Authors: Alberto Dennunzio, Luca Manzoni, Enrico Formenti 
Publication date: 14 January 2013
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/fi-2012-755
Recommendations
- Towards intrinsically universal asynchronous CA
- What do we mean by asynchronous CA? A reflection on types and effects of asynchronicity
- scientific article; zbMATH DE number 4068287
- A guided tour of asynchronous cellular automata
- An analysis of different types and effects of asynchronicity in cellular automata update schemes
Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cellular automata (computational aspects) (68Q80)
Cited In (38)
- Synchronous versus asynchronous cellular automata for simulating nano-systems kinetics
- A tutorial on elementary cellular automata with fully asynchronous updating. General properties and convergence dynamics
- \(m\)-asynchronous cellular automata: from fairness to quasi-fairness
- Towards intrinsically universal asynchronous CA
- 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
- Universal Construction on Self-Timed Cellular Automata
- Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues
- Dynamical behavior of additive cellular automata over finite abelian groups
- Supercritical probabilistic cellular automata: how effective is the synchronous updating?
- Computational complexity of finite asynchronous cellular automata
- ASYNCHRONOUS AUTOMATA NETWORKS CAN EMULATE ANY SYNCHRONOUS AUTOMATA NETWORK
- What do we mean by asynchronous CA? A reflection on types and effects of asynchronicity
- Computational aspects of asynchronous cellular automata
- Fast-Parallel Algorithms for Freezing Totalistic Asynchronous Cellular Automata
- Swarm Intelligence
- Implantation of cellular automata
- Characterizing Configuration Spaces of Simple Threshold Cellular Automata
- Computing by temporal order: asynchronous cellular automata
- Construction universality in purely asynchronous cellular automata
- Cellular automata -- a computational point of view
- Randomized Computation with Cellular Automata
- Chaos and ergodicity are decidable for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\)
- Complexity of the dynamics of reaction systems
- Three research directions in non-uniform cellular automata
- CLOUDS IN THE BASINS OF FULLY ASYNCHRONOUS CELLULAR AUTOMATA
- Title not available (Why is that?)
- An analysis of different types and effects of asynchronicity in cellular automata update schemes
- Foreword: Asynchronous cellular automata and nature-inspired computation
- Turing-completeness of asynchronous non-camouflage cellular automata
- Asynchronous cellular automata and Brownian motion
- Additive Cellular Automata Over Finite Abelian Groups: Topological and Measure Theoretic Properties
- Effect of random fluctuations on minimizing the complexity of universal asynchronous cellular automata
- A survey of cellular automata: types, dynamics, non-uniformity and applications
- Decidable characterizations of dynamical properties for additive cellular automata over a finite abelian group with applications to data encryption
- On the dynamical behaviour of linear higher-order cellular automata and its decidability
- A guided tour of asynchronous cellular automata
- Fixing monotone Boolean networks asynchronously
This page was built for publication: Computing issues of asynchronous CA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4902304)
