Experimental classification of elementary cellular automata using Markov chains
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 107541 (Why is no real title available?)
- Computation and universality: Class IV versus Class III cellular automata
- Exploring discrete dynamics. The DDLab manual
- Markov Chains
- Markov Chains
- Markov chain analysis for one-dimensional asynchronous cellular automata
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Markov chains approach for regional controllability of deterministic cellular automata, via boundary actions
- Markov chains. From theory to implementation and experimentation
- Matrix Analysis
- Non-negative matrices and Markov chains.
- Probabilistic cellular automata with general alphabets possessing a Markov chain as an invariant distribution
- Progress, gaps and obstacles in the classification of cellular automata
- Right-permutative cellular automata on topological Markov chains
- Stochastic processes. Theory for applications.
This page was built for publication: Experimental classification of elementary cellular automata using Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6890469)