The classification of one-sided Markov chains

被引：13

作者：

Ashley, J ^{[1
]}

Marcus, B ^{[1
]}

Tuncel, S ^{[1
]}

机构：

[1] UNIV WASHINGTON,DEPT MATH,SEATTLE,WA 98195

来源：

ERGODIC THEORY AND DYNAMICAL SYSTEMS | 1997年 / 17卷

关键词：

D O I：

10.1017/S0143385797069745

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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

引用

页码：269 / 295

页数：27

共 26 条

[1] EQUIVALENCE OF TOPOLOGICAL MARKOV SHIFTS [J].

ADLER, RL ;

GOODWYN, LW ;

WEISS, B .

ISRAEL JOURNAL OF MATHEMATICS, 1977, 27 (01) :49-63

[2]

ADLER RL, 1979, MEM AM MATH SOC, V219

[3]

[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness

[4]

[Anonymous], 1990, HDB THEORETICAL COMP

[5] BOUNDED-TO-1 FACTORS OF AN APERIODIC SHIFT OF FINITE-TYPE ARE 1-TO-1 ALMOST EVERYWHERE FACTORS ALSO [J].

ASHLEY, J .

ERGODIC THEORY AND DYNAMICAL SYSTEMS, 1990, 10 :615-625

[6] THE SPECTRA OF NONNEGATIVE MATRICES VIA SYMBOLIC DYNAMICS [J].

BOYLE, M ;

HANDELMAN, D .

ANNALS OF MATHEMATICS, 1991, 133 (02) :249-316

[7] REGULAR ISOMORPHISM OF MARKOV-CHAINS IS ALMOST TOPOLOGICAL [J].

BOYLE, M ;

TUNCEL, S .

ERGODIC THEORY AND DYNAMICAL SYSTEMS, 1990, 10 :89-100

[8]

CORDON A, 1982, THEOR COMPUT SCI, V19, P85

[9] AN EFFICIENT ALGORITHM FOR GRAPH ISOMORPHISM [J].

CORNEIL, DG ;

GOTLIEB, CC .

JOURNAL OF THE ACM, 1970, 17 (01) :51-&

[10] ISOMORPHISM OF WEAK BERNOULLI TRANSFORMATIONS [J].

FRIEDMAN, NA ;

ORNSTEIN, DS .

ADVANCES IN MATHEMATICS, 1970, 5 (03) :365-&

← 1 2 3 →