Abstract
AbstractLet S, T be subshifts of finite type, with Markov measures p, q on them, and let φ: (S, p) → (T, q) be a block code. Let Ip, Iq denote the information cocycles of p, q. For a subshift of finite type ⊂T, the pressure of equals that of . Applying this to Bernoulli shifts and using finiteness conditions on Perron numbers, we have the following. If the probability vector p = (p1…, pk+1) is such that the distinct transcendental elements of {p1/pk+1…pk/pk+1) are algebraically independent then the Bernoulli shift B(p) has finitely many Bernoulli images by block codes.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
