Skip to main content
Log in

On the classification of one-sided Markov chains

  • Published:
Israel Journal of Mathematics Aims and scope Submit manuscript

Abstract

In this paper we generalise a theorem of R. F. Williams about the topological classification of one-sided finite state stationary Markov chains. Specifically, we give a classification up to block-isomorphism, i.e. a topological conjugacy between one-sided Markov chains which preserves the Markov measures.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. W. Parry and S. Tuncel,On the stochastic and topological structure of Markov-chains, Bull. London Math. Soc.14 (1982), 16–27.

    Article  MATH  MathSciNet  Google Scholar 

  2. W. Parry and R. F. Williams,Block coding and a zeta function for finite Markov chains, Proc. London Math. Soc.35 (1977), 483–495.

    Article  MATH  MathSciNet  Google Scholar 

  3. R. F. Williams,Classification of subshifts of finite type, Ann. of Math.98 (1973), 120–153;Errata, Ann. of Math.99 (1974), 380–381.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cowen, R. On the classification of one-sided Markov chains. Israel J. Math. 67, 243–250 (1989). https://doi.org/10.1007/BF02937298

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02937298

Keywords

Navigation