2018
DOI: 10.1016/j.chaos.2018.06.004
|View full text |Cite
|
Sign up to set email alerts
|

Characterisation of the elementary cellular automata in terms of their maximum sensitivity to all possible asynchronous updates

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
3
3
1

Relationship

2
5

Authors

Journals

citations
Cited by 9 publications
(2 citation statements)
references
References 11 publications
0
2
0
Order By: Relevance
“…We will analyze its dynamical behavior through a detailed study of all its different dynamics by using the algorithms developed in [22] that, roughly speaking, list all the sets of schemes that generate exactly the same dynamics, significantly reducing the number of dynamics to analyze. These algorithms have been shown to be effective in obtaining new and relevant information for the study of concrete biological networks [34,35] as well as in the field of the cellular automata theory [36][37][38][39][40][41].…”
Section: Lemmamentioning
confidence: 99%
“…We will analyze its dynamical behavior through a detailed study of all its different dynamics by using the algorithms developed in [22] that, roughly speaking, list all the sets of schemes that generate exactly the same dynamics, significantly reducing the number of dynamics to analyze. These algorithms have been shown to be effective in obtaining new and relevant information for the study of concrete biological networks [34,35] as well as in the field of the cellular automata theory [36][37][38][39][40][41].…”
Section: Lemmamentioning
confidence: 99%
“…In recent studies, it has been shown that synchronous updating is not in accordance with many real processes (Baetens et al, ; Bandman, ; Barreira‐González et al, ; Cornforth, Green, & Newth, ; Kim, ; Lee, Adachi, Peper, & Morita, ; O'Sullivan & Torrens, ; Ruivo, Montalva‐Medel, Paulo Balbi de Oliveira, & Perrot, ; Schönfisch & de Roos, ) and therefore, due to the temporal nature of entities, asynchronous CA is more realistic than synchronous CA and achieves more accurate results (Ke et al, ). Schönfisch and de Roos () compared several updating methods for CA.…”
Section: Introductionmentioning
confidence: 99%