Characterisation of the elementary cellular automata in terms of their maximum sensitivity to all possible asynchronous updates
From MaRDI portal
Publication:1755339
DOI10.1016/J.CHAOS.2018.06.004zbMath1404.37014OpenAlexW2811417714MaRDI QIDQ1755339
Marco Montalva-Medel, Pedro P. B. de Oliveira, Eurico L. P. Ruivo, Kévin Perrot
Publication date: 9 January 2019
Published in: Chaos, Solitons and Fractals (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.chaos.2018.06.004
Related Items (4)
Non-maximal sensitivity to synchronism in elementary cellular automata: exact asymptotic measures ⋮ Maximum sensitivity to update schedules of elementary cellular automata over periodic configurations ⋮ Maximum sensitivity to update schedules of elementary cellular automata over infinite configurations ⋮ A spectral outlook on the elementary cellular automata with cyclic configurations and block-sequential asynchronous updates
Cites Work
- Computation of functions on \(n\) bits by asynchronous clocking of cellular automata
- Combinatorics on update digraphs in Boolean networks
- Maximum number of fixed points in regulatory Boolean networks
- Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework
- Simulating complex systems by cellular automata.
- Fixed points and connections between positive and negative cycles in Boolean networks
- Lattice-gas cellular automata and lattice Boltzmann models. An introduction
- On the number of update digraphs and its relation with the feedback arc sets and tournaments
- MODELING INFECTIOUS DISEASES USING GLOBAL STOCHASTIC CELLULAR AUTOMATA
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Characterisation of the elementary cellular automata in terms of their maximum sensitivity to all possible asynchronous updates
