On the marker method for constructing finitary isomorphisms
The paper formalizes the ``marker part of the ``marker and filler machinery developed by Keane and Smorodinsky in the 1970s. This method allows to show that two irreducible equal entropy finite state Markov processes are finitary isomorphic provided they have the same period. The author defines the notion of d-equivalence of processes which assigns to a pair of processes a nonnegative integer. Roughly speaking it ``measures how closely related are these processes. Upper bounds for the d-equivalence are obtained for Bernoulli schemes, Markov chains and r-processes.
- On finitary shifts
- Finitarily deterministic generators for zero entropy systems
- Constructing finitary isomorphisms with finite expected coding times
- Finitary isomorphisms of Poisson point processes
- Finitary isomorphisms of some infinite entropy Bernoulli flows
- When are two Markov chains the same?
- A monotone Sinai theorem
- Notes on finitary isomorphism markers in countable state Markov processes
- A note on r-processes
- Any two irreducible Markov chains of equal entropy are finitarily Kakutani equivalent
- Finitary isomorphism of some renewal processes to Bernoulli schemes
This page was built for publication: On the marker method for constructing finitary isomorphisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q422025)
