Non-maximal sensitivity to synchronism in elementary cellular automata: exact asymptotic measures

DOI10.1016/j.tcs.2022.05.024OpenAlexW4282018573MaRDI QIDQ2152436

Enrico Formenti, Pedro Paulo Balbi, Sara Riva, Kévin Perrot, Eurico L. P. Ruivo

Publication date: 8 July 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.05.024

zbMATH Keywords

cellular automataelementary cellular automataasynchronous dynamics

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15)

Uses Software

• OEIS

Cites Work

• \(m\)-asynchronous cellular automata: from fairness to quasi-fairness
• Dynamics groups of asynchronous cellular automata
• Combinatorics on update digraphs in Boolean networks
• Characterisation of the elementary cellular automata in terms of their maximum sensitivity to all possible asynchronous updates
• Non-maximal sensitivity to synchronism in periodic elementary cellular automata: exact asymptotic measures
• Maximum sensitivity to update schedules of elementary cellular automata over infinite configurations
• Order Independence in Asynchronous Cellular Automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Non-maximal sensitivity to synchronism in elementary cellular automata: exact asymptotic measures