Powers of positive polynomials and codings of Markov chains onto Bernoulli shifts
From MaRDI portal
Publication:4485747
DOI10.1090/S1079-6762-99-00066-9zbMath0944.28013OpenAlexW155035785MaRDI QIDQ4485747
Publication date: 18 June 2000
Published in: Electronic Research Announcements of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/222886
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Unnamed Item
- Entropy at a weight-per-symbol and embeddings of Markov chains
- Invariants for finitary isomorphisms with finite expected code lengths
- Factors and extensions of full shifts
- Resolving Markov chains onto Bernoulli shifts via positive polynomials
- Regular isomorphism of Markov chains is almost topological
- Positive polynomials and product type actions of compact groups
- Resolving maps and the dimension group for shifts of finite type
- On the Stochastic and Topological Structure of Markov Chains
- Resolving factor maps for shifts of finite type with equal entropy
- Matrices of Polynomials, Positivity, and Finite Equivalence of Markov Chains
- The classification of one-sided Markov chains
- An Introduction to Symbolic Dynamics and Coding
- The weight-per-symbol polytope and scaffolds of invariants associated with Markov chains
This page was built for publication: Powers of positive polynomials and codings of Markov chains onto Bernoulli shifts