Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS
   
Mobile Device Pairing
Green Open Access
Proceedings of the American Mathematical Society
Proceedings of the American Mathematical Society
ISSN 1088-6826(online) ISSN 0002-9939(print)

 

Coding nested mixing one-sided subshifts
of finite type as Markov shifts having
exactly the same alphabet


Authors: Alejandro Maass and Servet Martínez
Journal: Proc. Amer. Math. Soc. 126 (1998), 1219-1230
MSC (1991): Primary 54H20, 58F03
MathSciNet review: 1425133
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: Let $X_{0}$, $X$ be mixing one-sided subshifts of finite type such that $X_{0}\subseteq X$. We show a necessary and sufficient condition for the existence of mixing Markov shifts $Y_{0}$, $Y$, $Y_{0}\subseteq Y$, and a conjugacy $\pi : Y\to X$ with $\pi (Y_{0})=X_{0}$, such that the sets of letters appearing in both systems are the same, more precisely, $L_{1}(Y_{0})=L_{1}(Y)$.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Proceedings of the American Mathematical Society with MSC (1991): 54H20, 58F03

Retrieve articles in all journals with MSC (1991): 54H20, 58F03


Additional Information

Alejandro Maass
Affiliation: Departamento de Ingeniería Matemática, Universidad de Chile, Casilla 170/3 Correo 3, Santiago, Chile
Email: amaass@dim.uchile.cl

Servet Martínez
Affiliation: Departamento de Ingeniería Matemática, Universidad de Chile, Casilla 170/3 Correo 3, Santiago, Chile
Email: smartine@dim.uchile.cl

DOI: http://dx.doi.org/10.1090/S0002-9939-98-04174-4
PII: S 0002-9939(98)04174-4
Received by editor(s): April 16, 1996
Received by editor(s) in revised form: September 23, 1996
Communicated by: Mary Rees
Article copyright: © Copyright 1998 American Mathematical Society