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

DOI10.1016/J.IC.2020.104538MaRDI QIDQ2201797zbMATH OpenOpenAlexFDO

Authors Eurico L. P. Ruivo, Pedro Paulo Balbi, Marco Montalva-Medel, Kévin Perrot

Publication date 17 September 2020

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2020.104538

zbMATH Keywords

elementary cellular automataBoolean networksupdate schedulesasynchronous updatesmaximum sensitivityupdate digraphs

Mathematics Subject Classification ID

Dynamical aspects of cellular automata (37B15) Dynamical systems involving maps of trees and graphs (37E25)

Recommendations

• Characterisation of the elementary cellular automata in terms of their maximum sensitivity to all possible asynchronous updates
• Asynchronous cellular automata and dynamical properties
• An analysis of different types and effects of asynchronicity in cellular automata update schemes
• Effect of asynchronous updating on the stability of cellular automata
• What do we mean by asynchronous CA? A reflection on types and effects of asynchronicity

Cites work

• scientific article; zbMATH DE number 1818513 (Why is no real title available?)
• A study on learning robustness using asynchronous 1D cellular automata rules
• Characterisation of the elementary cellular automata in terms of their maximum sensitivity to all possible asynchronous updates
• Combinatorics on update digraphs in Boolean networks
• Computation of functions on n bits by asynchronous clocking of cellular automata
• Computational complexity of finite asynchronous cellular automata
• Deconstruction and dynamical robustness of regulatory networks: application to the yeast cell cycle networks
• Evolutionary games and computer simulations.
• From one-dimensional to two-dimensional cellular automata
• Guided tour of asynchronous cellular automata
• Theory of cellular automata: a survey

Cited in

(5)

• The impact of alphabet size on pattern complexity of maxmin- cellular automata
• Characterisation of the elementary cellular automata in terms of their maximum sensitivity to all possible asynchronous updates
• Non-maximal sensitivity to synchronism in elementary cellular automata: exact asymptotic measures
• Random expansion method for the generation of complex cellular automata
• Maximum sensitivity to update schedules of elementary cellular automata over periodic configurations

This page was built for publication: Maximum sensitivity to update schedules of elementary cellular automata over infinite configurations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2201797)