On the Complexity of Limit Sets of Cellular Automata Associated with Probability Measures
From MaRDI portal
Recommendations
- Limit sets of cellular automata associated to probability measures
- Characterization of sets of limit measures of a cellular automaton iterated on a random configuration
- Complexity of generic limit sets of cellular automata
- \(\mu\)-limit sets of cellular automata from a computational complexity perspective
- On the Limit Sets of Cellular Automata
- Characterisation of limit measures of higher-dimensional cellular automata
- On the limit set of some universal cellular automata
- Limit measures for affine cellular automata
- Limit measures for affine cellular automata II
- scientific article; zbMATH DE number 919608
Cited in
(12)- Measure theoretic approach to the classification of cellular automata
- A generalization of Chaitin's halting probability \(\Omega\) and halting self-similar sets
- Characterisation of limit measures of higher-dimensional cellular automata
- Complexity of generic limit sets of cellular automata
- Arithmetical complexity of the language of generic limit sets of cellular automata
- Rice's theorem for -limit sets of cellular automata
- Probability and algorithmics: a focus on some recent developments
- Characterization of sets of limit measures of a cellular automaton iterated on a random configuration
- A uniquely ergodic cellular automaton
- \(\mu\)-limit sets of cellular automata from a computational complexity perspective
- Limit sets of cellular automata associated to probability measures
- Directional dynamics for cellular automata: A sensitivity to initial condition approach
This page was built for publication: On the Complexity of Limit Sets of Cellular Automata Associated with Probability Measures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756724)
