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.
