Hostname: page-component-74656f9884-2dmjx Total loading time: 0 Render date: 2026-11-09T18:12:03.847Z Has data issue: false hasContentIssue false
  • English
  • Français

The classification of one-sided Markov chains

Published online by Cambridge University Press:  17 April 2001

JONATHAN ASHLEY ,
BRIAN MARCUS  and
SELIM TUNCEL
JONATHAN ASHLEY
Affiliation:
IBM Almaden Research Center, K53/802, 650 Harry Road, San Jose, CA 95120, USA (e-mail: jashley@almaden.ibm.com; e-mail: marcus@almaden.ibm.com)
BRIAN MARCUS
Affiliation:
IBM Almaden Research Center, K53/802, 650 Harry Road, San Jose, CA 95120, USA (e-mail: jashley@almaden.ibm.com; e-mail: marcus@almaden.ibm.com)
SELIM TUNCEL
Affiliation:
Department of Mathematics, University of Washington, Seattle, WA 98195, USA (e-mail: tuncel@math.washington.edu)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We completely classify one-sided Markov chains up to measure-theoreticisomorphism. The classification is effective and computable.

Information

Type
Research Article
Information
Ergodic Theory and Dynamical Systems , Volume 17 , Issue 2 , April 1997 , pp. 269 - 295
Copyright
1997 Cambridge University Press