On the Complexity of Limit Sets of Cellular Automata Associated with Probability Measures
From MaRDI portal
Publication:5756724
DOI10.1007/11821069_17zbMath1132.68494OpenAlexW1524517503MaRDI QIDQ5756724
Guillaume Theyssier, Laurent Boyer, Victor Poupet
Publication date: 5 September 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11821069_17
Related Items (7)
Characterisation of limit measures of higher-dimensional cellular automata ⋮ Probability and algorithmics: a focus on some recent developments ⋮ A uniquely ergodic cellular automaton ⋮ Directional dynamics for cellular automata: A sensitivity to initial condition approach ⋮ \(\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 ⋮ Rice’s Theorem for μ-Limit Sets of Cellular Automata
This page was built for publication: On the Complexity of Limit Sets of Cellular Automata Associated with Probability Measures