Roy L. Adler, Don Coppersmith, et al.
IEEE Trans. Inf. Theory
We show that any two topological Markov shifts both of whose topological entropy equals log n (for some n) are equivalent by a finitistic coding. © 1977 Hebrew University.
Roy L. Adler, Don Coppersmith, et al.
IEEE Trans. Inf. Theory
Roy L. Adler
Bulletin of the American Mathematical Society
Roy L. Adler, Jean-Pierre Dedieu, et al.
IMA Journal of Numerical Analysis
Benjamin Weiss
Proceedings of the American Mathematical Society