Powers of positive polynomials and codings of Markov chains onto Bernoulli shifts
From MaRDI portal
Publication:4485747
Recommendations
Cites work
- An Introduction to Symbolic Dynamics and Coding
- Entropy at a weight-per-symbol and embeddings of Markov chains
- Factors and extensions of full shifts
- scientific article; zbMATH DE number 177174 (Why is no real title available?)
- scientific article; zbMATH DE number 3463931 (Why is no real title available?)
- Invariants for finitary isomorphisms with finite expected code lengths
- Matrices of Polynomials, Positivity, and Finite Equivalence of Markov Chains
- On the Stochastic and Topological Structure of Markov Chains
- Positive polynomials and product type actions of compact groups
- Regular isomorphism of Markov chains is almost topological
- Resolving factor maps for shifts of finite type with equal entropy
- Resolving maps and the dimension group for shifts of finite type
- Resolving Markov chains onto Bernoulli shifts via positive polynomials
- The classification of one-sided Markov chains
- The weight-per-symbol polytope and scaffolds of invariants associated with Markov chains
Cited in
(2)
This page was built for publication: Powers of positive polynomials and codings of Markov chains onto Bernoulli shifts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4485747)