scientific article; zbMATH DE number 4025761
[For the entire collection see Zbl 0562.00005.] The purpose of this note is to give a brief survey of the problem of finding isomorphisms of Markov shifts which take into account the sequential structure of these processes, and which can be interpreted as realistic `coding' or `translation' procedures. The interpretation of such isomorphisms as translation procedures is suggested by the fact that Markov shifts resemble (very idealized) languages: a Markov shift is determined by a finite alphabet, a finite set of `grammatical rules' which excludes certain combinations of letters (or symbols) in the alphabet, and an assignment of `likelihood' to the various allowed combinations of symbols, just as ordinary languages distinguish between rare and frequently used words.
- Code length between Markov processes
- Coding Markov chains from the past
- Coding map for a contractive Markov system
- Coded equivalence of one-sided topological Markov shifts
- Variable to fixed-length codes for Markov sources
- Transducing Markov sequences
- On Mealy–Moore coding and images of Markov measures
- On Finite Coding Factors of a Class of Random Markov Chains
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3767552)