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
Dan Chazan, Alan G. Konheim, et al.
Journal of Combinatorial Theory
Alan G. Konheim, Benjamin Weiss
Pacific Journal of Mathematics
Roy L. Adler, Benjamin Weiss
Israel Journal of Mathematics