PERFECTION IN R-PROCESSES

DOI10.1142/S1793830909000269zbMath1198.05075OpenAlexW2065996911MaRDI QIDQ3646204

Stephen M. Shea

Publication date: 19 November 2009

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830909000269

zbMATH Keywords

perfect graphMarkovBernoulli schemer-process

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Perfect graphs (05C17) Renewal theory (60K05)

Cites Work

• Unnamed Item
• The finitary coding of two Bernoulli schemes with unequal entropies has finite expectation
• Finitary isomorphisms of irreducible Markov shifts
• A class of finitary codes
• Bernoulli schemes of the same entropy are finitarily isomorphic
• Factors of Bernoulli shifts are Bernoulli shifts
• Normal hypergraphs and the perfect graph conjecture
• On the finitary isomorphisms of markov shifts that have finite expected coding time
• A mixing Markov chain with exponentially decaying return times is finitarily Bernoulli
• Finitary Isomorphisms with Finite Expected Code Lengths
• Finitary codes between Markov processes

This page was built for publication: PERFECTION IN R-PROCESSES