Extensions on the analysis of elementary cellular automata with process graphs

DOI10.1007/978-3-031-78757-7_4MaRDI QIDQ6890475zbMATH OpenFDO

Authors Lia Kassardjian, Pedro Paulo Balbi, Eurico L. P. Ruivo

Publication date 3 December 2025

Full work available at URL https://doi.org/10.1007/978-3-031-78757-7_4

Mathematics Subject Classification ID

Dynamical systems and ergodic theory (37-XX) Dynamical aspects of cellular automata (37B15) Computer science (68-XX) Cellular automata (computational aspects) (68Q80)

Cites work

• Arithmetical complexity of the language of generic limit sets of cellular automata
• Computation theory of cellular automata
• scientific article; zbMATH DE number 1818513 (Why is no real title available?)
• scientific article; zbMATH DE number 726524 (Why is no real title available?)
• Inferring the Limit Behavior of Some Elementary Cellular Automata
• On the undecidability of the limit behavior of cellular automata
• Statistical mechanics of cellular automata
• Subshifts of finite type and sofic systems
• The attractor-basin portrait of a cellular automaton
• Theory of cellular automata: a survey
• Universality in elementary cellular automata

This page was built for publication: Extensions on the analysis of elementary cellular automata with process graphs

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