Maximum sensitivity to update schedules of elementary cellular automata over periodic configurations

Abstract : This work is a thoughtful extension of the ideas sketched in [Montalva et al. 2017], aiming at classifying elementary cellular automata (ECA) according to their maximal one-step sensitivity to changes in the schedule of cells update. It provides a complete classification of the ECA rule space for all period sizes n > 9 and, together with the classification for all period sizes n ≤ 9 presented in [Montalva et al. 2018], closes this problem and opens further questionings. Most of the 256 ECA rule's sensitivity is proved or disproved to be maximum thanks to an automatic application of basic methods. We formalize meticulous case disjunctions that lead to the results, and patch failing cases for some rules with simple arguments. This gives new insights on the dynamics of ECA rules depending on the proof method employed, as for the last rules 45 and 105 requiring (0011) * induction patterns.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02179732
Contributor : Kévin Perrot <>
Submitted on : Thursday, July 11, 2019 - 10:13:46 PM
Last modification on : Friday, July 12, 2019 - 4:02:11 PM

File

ECA-synchronismSensibility.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Kévin Perrot, Marco Montalva-Medel, Pedro de Oliveira, Eurico Ruivo. Maximum sensitivity to update schedules of elementary cellular automata over periodic configurations. 2019. ⟨hal-02179732⟩

Share

Metrics

Record views

50

Files downloads

34