On the marker method for constructing finitary isomorphisms (Q422025)

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.