Hostname: page-component-76fb5796d-qxdb6 Total loading time: 0 Render date: 2024-04-25T13:44:00.429Z Has data issue: false hasContentIssue false

The classification of one-sided Markov chains

Published online by Cambridge University Press:  17 April 2001

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)

Abstract

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

Type
Research Article
Copyright
1997 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)