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

DOI10.1016/J.IC.2020.104538zbMATH Open1458.37022OpenAlexW2960012621MaRDI QIDQ2201797FDOQ2201797

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

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

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)

Cites Work

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

Cited In (2)

• Non-maximal sensitivity to synchronism in elementary cellular automata: exact asymptotic measures
• Random expansion method for the generation of complex cellular automata

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)