Asymptotic (a)synchronism sensitivity and complexity of elementary cellular automata

DOI10.1007/978-3-031-55601-2_18MaRDI QIDQ6547963zbMATH OpenFDO

Authors Isabel Donoso Leiva, Eric Goles, Martín Ríos-Wilson, Sylvain Sené

Publication date 31 May 2024

Full work available at URL https://doi.org/10.1007/978-3-031-55601-2_18

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cites work

• m-asynchronous cellular automata: from fairness to quasi-fairness
• A logical calculus of the ideas immanent in nervous activity
• About block-parallel Boolean networks: a position paper
• An experimental study of robustness to asynchronism for elementary cellular automata
• Automata Studies. (AM-34)
• Combinatorics on update digraphs in Boolean networks
• Comparison between parallel and serial dynamics of Boolean networks
• Computational complexity of finite asynchronous cellular automata
• scientific article; zbMATH DE number 3896307 (Why is no real title available?)
• scientific article; zbMATH DE number 4074492 (Why is no real title available?)
• scientific article; zbMATH DE number 45557 (Why is no real title available?)
• Itérations sur des ensembles finis et automates cellulaires contractants
• Languages, equicontinuity and attractors in cellular automata
• On the largest product of primes with bounded sum
• Phenomenlogy of nonlocal cellular automata
• Rice's theorem for the limit sets of cellular automata
• Simple Computation-Universal Cellular Spaces
• Synchronism versus asynchronism in monotonic Boolean automata networks
• Synchronous, asynchronous, and causally ordered communication

Cited in

(1)

• Dynamical stability of threshold networks over undirected signed graphs

This page was built for publication: Asymptotic (a)synchronism sensitivity and complexity of elementary cellular automata

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