Y.Y. Li, K.S. Leung, et al.
J Combin Optim
Paper
The classification of one-sided Markov chains
Abstract
We completely classify one-sided Markov chains up to measure-theoretic isomorphism. The classification is effective and computable.
Related
Conference paper
Distilling common randomness from bipartite quantum states
Igor Devetak, Andreas Winter
ISIT 2003
Conference paper
Compression for data archiving and backup revisited
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009
Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences