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

DOI10.1007/s11047-019-09743-9zbMath1530.37032OpenAlexW3018738446MaRDI QIDQ6151157

Marco Montalva-Medel, Kévin Perrot, Eurico L. P. Ruivo, Pedro P. B. de Oliveira

Publication date: 9 February 2024

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-019-09743-9

zbMATH Keywords

elementary cellular automataupdate digraphsynchronism sensitivity

Mathematics Subject Classification ID

Dynamical aspects of cellular automata (37B15)

Related Items (1)

\#P-completeness of counting update digraphs, cacti, and series-parallel decomposition method

Cites Work

• Combinatorics on update digraphs in Boolean networks
• Characterisation of the elementary cellular automata in terms of their maximum sensitivity to all possible asynchronous updates
• Theory of cellular automata: a survey
• On the number of update digraphs and its relation with the feedback arc sets and tournaments
• Stochastic Cellular Automata Solve the Density Classification Problem with an Arbitrary Precision
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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