, rules have particular inductive proof of max-sensitivity, 12 rules have inductive proof of max-sensitivity, vol.13, p.168
, All the result presented above are in accordence with the exhaustive experimental results for all n ? 9 3
On the number of update digraphs and its relation with the feedback arc sets and tournaments, Discrete Applied Mathematics, vol.161, issue.10, pp.1345-1355, 2013. ,
, Combinatorics on update digraphs in boolean networks, vol.159, pp.401-409, 2011.
On the robustness of update schedules in boolean networks, Biosystems, vol.97, pp.1-8, 2009. ,
Universality in elementary cellular automata, Complex Systems, vol.15, issue.1, pp.1-40, 2004. ,
On density determination with cellular automata: results, constructions and directions, Journal of Cellular Automata, vol.9, issue.5-6, pp.357-385, 2014. ,
Stochastic Cellular Automata Solve the Density Classification Problem with an Arbitrary Precision, Leibniz International Proceedings in Informatics (LIPIcs), vol.9, pp.284-295, 2011. ,
A guided tour of asynchronous cellular automata, Journal of Cellular Automata, vol.9, issue.5-6, pp.387-416, 2014. ,
Mathematical games: The fantastic combinations of John Conway's new solitaire game, Life". Scientific American, vol.223, issue.4, pp.120-123, 1970. ,
Theory of cellular automata: A survey, Theoretical Computer Science, vol.334, issue.1-3, pp.3-33, 2005. ,
Sensitivity to synchronism in some boolean automata networks, AUTOMATA 2017 Exploratory Papers proceedings, pp.69-76, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01785462
Characterisation of the elementary cellular automata in terms of their maximum sensitivity to all possible asynchronous updates, Chaos, Solitons & Fractals, vol.113, pp.209-220, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-02093397
Mises à jour de réseaux d'automates, 2012. ,
, A New Kind of Science. Wolfram Media, 2002.