Notes on Coding Problems for Finite State Processes

DOI10.1112/blms/23.1.1zbMath0808.28013OpenAlexW2079812735MaRDI QIDQ3978864

William Parry

Publication date: 25 June 1992

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/blms/23.1.1

zbMATH Keywords

topological conjugacyMarkov shiftsclassification of subshifts of finite type

Mathematics Subject Classification ID

Measure-preserving transformations (28D05) Ergodic theory of linear operators (47A35) Entropy and other invariants (28D20) Low-dimensional dynamical systems (37E99)

Related Items

Mixing shifts of finite type with non-elementary surjective dimension representations ⋮ Path methods for strong shift equivalence of positive matrices ⋮ The mathematical research of William Parry FRS ⋮ Almost isomorphism for countable state Markov shifts ⋮ Flow equivalence of G-SFTs ⋮ Constructing finitary isomorphisms with finite expected coding times

This page was built for publication: Notes on Coding Problems for Finite State Processes