The weight-per-symbol polytope and scaffolds of invariants associated with Markov chains

[1]  J. Ashley.  Bounded-to-1 factors of an aperiodic shift of finite type are 1-to-1 almost everywhere factors also , 1990, Ergodic Theory and Dynamical Systems.

[2]  Klaus Schmidt,et al.  Natural coefficients and invariants for Markov-shifts , 1984 .

[3]  David Handelman.  Deciding eventual positivity of polynomials , 1986 .

[4]  Selim Tuncel,et al.  On the classification of Markov chains by finite equivalence , 1981 .

[5]  Wolfgang Krieger,et al.  On the finitary isomorphisms of markov shifts that have finite expected coding time , 1983 .

[6]  S. Friedland.  Limit eigenvalues of nonnegative matrices , 1986 .

[7]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

[8]  Masakazu Nasu.  Uniformly finite-to-one and onto extensions of homomorphisms between strongly connected graphs , 1982, Discret. Math..

[9]  Selim Tuncel,et al.  Conditional pressure and coding , 1981 .

[10]  Selim Tuncel.  A Dimension, Dimension Modules, and Markov Chains , 1983 .

[11]  On the Stochastic and Topological Structure of Markov Chains , 1982 .

[12]  William Parry.  Notes on Coding Problems for Finite State Processes , 1991 .

[13]  R. F. Williams.  Classification of subshifts of finite type , 1973 .

[14]  An invariant for continuous factors of Markov shifts , 1981 .

[15]  B. Marcus,et al.  Continuous Homomorphisms of Bernoulli Schemes , 1981 .

[16]  Mike Boyle,et al.  Resolving maps and the dimension group for shifts of finite type , 1987 .

[17]  Masakazu Nasu.  Constant-to-one and onto global maps of homomorphisms between strongly connected graphs , 1983 .

[18]  Klaus Schmidt.  Invariants for finitary isomorphisms with finite expected code lengths , 1984 .