TY - JOUR

T1 - Maximum sensitivity to update schedules of elementary cellular automata over infinite configurations

AU - Ruivo, Eurico L.P.

AU - Balbi, Pedro Paulo

AU - Montalva-Medel, Marco

AU - Perrot, Kévin

N1 - Funding Information:
This work was partially supported by FONDECYT Iniciación 11150827 ; ECOS-CONICYT C16E01 ; PACA project FRI-2015 01134 ; PEPS JCJC INS2I project CGETA; Young Researcher project ANR-18-CE40-0002-01 “FANs”; STIC-AmSud CoDANet project: 19-STIC-03 Campus France 43478PD and CAPES 88881.197456/2018-01 ; CAPES PrInt project 88887.310281/2018-00 ; and CNPq PQ 305199-6 .
Publisher Copyright:
© 2020 Elsevier Inc.

PY - 2020/10

Y1 - 2020/10

N2 - Cellular automata are discrete dynamical systems with locally defined behaviour, well known as simple models of complex systems. Classically, their dynamics derive from synchronously iterated rules over finite or infinite configurations; however, since for many natural systems to be modelled, asynchrony seems more plausible, asynchronous iteration of the rules has gained a considerable attention in recent years. One question in this context is how changing the update schedule of rule applications affects the global behaviour of the system. In particular, previous works addressed the notion of maximum sensitivity to changes in the update schemes for finite lattices. Here, we extend the notion to infinite lattices, and classify elementary cellular automata space according to such a property.

AB - Cellular automata are discrete dynamical systems with locally defined behaviour, well known as simple models of complex systems. Classically, their dynamics derive from synchronously iterated rules over finite or infinite configurations; however, since for many natural systems to be modelled, asynchrony seems more plausible, asynchronous iteration of the rules has gained a considerable attention in recent years. One question in this context is how changing the update schedule of rule applications affects the global behaviour of the system. In particular, previous works addressed the notion of maximum sensitivity to changes in the update schemes for finite lattices. Here, we extend the notion to infinite lattices, and classify elementary cellular automata space according to such a property.

KW - Asynchronous updates

KW - Boolean networks

KW - Elementary cellular automata

KW - Maximum sensitivity

KW - Update digraphs

KW - Update schedules

UR - http://www.scopus.com/inward/record.url?scp=85080980011&partnerID=8YFLogxK

U2 - 10.1016/j.ic.2020.104538

DO - 10.1016/j.ic.2020.104538

M3 - Article

AN - SCOPUS:85080980011

VL - 274

JO - Information and Computation

JF - Information and Computation

SN - 0890-5401

M1 - 104538

ER -