Rice’s Theorem for μ-Limit Sets of Cellular Automata

DOI10.1007/978-3-642-22012-8_6zbMath1334.68141OpenAlexW2057350587MaRDI QIDQ3012911

Martin Delacourt

Publication date: 7 July 2011

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22012-8_6

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Decidability of theories and sets of sentences (03B25)

Related Items (7)

Self-organisation in cellular automata with coalescent particles: qualitative and quantitative approaches ⋮ Subshifts as models for MSO logic ⋮ Statistical mechanics of surjective cellular automata ⋮ Characterisation of limit measures of higher-dimensional cellular automata ⋮ \(\mu\)-limit sets of cellular automata from a computational complexity perspective ⋮ Characterization of sets of limit measures of a cellular automaton iterated on a random configuration ⋮ Freezing, Bounded-Change and Convergent Cellular Automata

Cites Work

• Unnamed Item
• Directional dynamics along arbitrary curves in cellular automata
• Lexicographic compositions and de Bruijn sequences
• Rice's theorem for the limit sets of cellular automata
• Revisiting the Rice Theorem of Cellular Automata
• On the Complexity of Limit Sets of Cellular Automata Associated with Probability Measures
• Classes of Recursively Enumerable Sets and Their Decision Problems
• Limit sets of cellular automata associated to probability measures

This page was built for publication: Rice’s Theorem for μ-Limit Sets of Cellular Automata