Eventual extensions of finite codes

  • Boyle M
10Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

Suppose S S and T T are shift equivalent mixing shifts of finite type, and f f is a conjugacy from a subsystem of S S to a subsystem of T T . Then for any sufficiently large n n , f f extends to a conjugacy of S n {S^n} and T n {T^n} . A consequence of the proof is a fortified version of Wagoner’s Stable FOG Theorem.

Cite

CITATION STYLE

APA

Boyle, M. (1988). Eventual extensions of finite codes. Proceedings of the American Mathematical Society, 104(3), 965–972. https://doi.org/10.1090/s0002-9939-1988-0964880-8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free