scientific article
From MaRDI portal
Publication:2811213
zbMath1338.68183arXiv1406.0792MaRDI QIDQ2811213
Publication date: 10 June 2016
Full work available at URL: https://arxiv.org/abs/1406.0792
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cellular automata (computational aspects) (68Q80) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (28)
Logical gates on gliders in restricted space domain cellular automata ⋮ Temporally Stochastic Cellular Automata: Classes and Dynamics ⋮ Discrete models of complex systems: recent trends and analytical challenges ⋮ Non-maximal sensitivity to synchronism in elementary cellular automata: exact asymptotic measures ⋮ A study on delay-sensitive cellular automata ⋮ Convergence Time of Probabilistic Cellular Automata on the Torus ⋮ Percolation Operators and Related Models ⋮ Phase Transitions of Cellular Automata ⋮ A Trade-Off Between Simplicity and Robustness? Illustration on a Lattice-Gas Model of Swarming ⋮ Maximum sensitivity to update schedules of elementary cellular automata over periodic configurations ⋮ A tutorial on elementary cellular automata with fully asynchronous updating. General properties and convergence dynamics ⋮ 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 ⋮ Asynchronous communicating cellular automata: formalization, robustness and equivalence ⋮ On the Reversibility of ECAs with Fully Asynchronous Updating: The Recurrence Point of View ⋮ CLOUDS IN THE BASINS OF FULLY ASYNCHRONOUS CELLULAR AUTOMATA ⋮ Maximum sensitivity to update schedules of elementary cellular automata over infinite configurations ⋮ A perfect solution to the parity problem with elementary cellular automaton 150 under asynchronous update ⋮ A probabilistic cellular automata model for the dynamics of a population driven by logistic growth and weak Allee effect ⋮ A generalized neighborhood for cellular automata ⋮ Characterisation of the elementary cellular automata with neighbourhood priority based deterministic updates ⋮ Characterisation of the elementary cellular automata in terms of their maximum sensitivity to all possible asynchronous updates ⋮ Local structure approximation as a predictor of second-order phase transitions in asynchronous cellular automata ⋮ An asynchronous solution to the synchronisation problem for binary one-dimensional cellular automata ⋮ Effect of random fluctuations on minimizing the complexity of universal asynchronous cellular automata ⋮ From multiple to single updates per cell in elementary cellular automata with neighbourhood based priority ⋮ A spectral outlook on the elementary cellular automata with cyclic configurations and block-sequential asynchronous updates ⋮ \#P-completeness of counting update digraphs, cacti, and series-parallel decomposition method
This page was built for publication:
