Non-maximal Sensitivity to Synchronism in Periodic Elementary Cellular Automata: Exact Asymptotic Measures

Balbi P.P.; Formenti E.; Perrot K.; Riva S.; Ruivo E.L.P.

Non-maximal Sensitivity to Synchronism in Periodic Elementary Cellular Automata: Exact Asymptotic Measures

Tipo

Artigo de evento

Data de publicação

2020

Periódico

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Citações (Scopus)

1

Autores

Balbi P.P.
Formenti E.
Perrot K.
Riva S.
Ruivo E.L.P.

Resumo

© 2020, IFIP International Federation for Information Processing.In [10] and [12] the authors showed that elementary cellular automata rules 0, 3, 8, 12, 15, 28, 32, 34, 44, 51, 60, 128, 136, 140, 160, 162, 170, 200 and 204 (and their conjugation, reflection, reflected-conjugation) are not maximum sensitive to synchronism, i.e., they do not have a different dynamics for each (non-equivalent) block-sequential update schedule (defined as ordered partitions of cell positions). In this work we present exact measurements of the sensitivity to synchronism for these rules, as functions of the size. These exhibit a surprising variety of values and associated proof methods, such as the special pairs of rule 128, and the connection to the bissection of Lucas numbers of rule 8.

Assuntos Scopus

Block-sequential , Elementary cellular automaton , Lucas numbers , Measurements of , Proof methods