Hostname: page-component-586b7cd67f-l7hp2 Total loading time: 0 Render date: 2024-11-28T05:38:53.350Z Has data issue: false hasContentIssue false
  • English
  • Français

Open maps between shift spaces

Published online by Cambridge University Press:  01 August 2009

UIJIN JUNG
UIJIN JUNG*
Affiliation:
Department of Mathematical Sciences, KAIST, Daejeon 305-701, Korea (email: uijin@kaist.ac.kr)
Get access Rights & Permissions [Opens in a new window]

Abstract

Given a code from a shift space to an irreducible sofic shift, any two of the three conditions—open, constant-to-one and (right or left) closing—imply the third. If the range is not sofic, then the same result holds when bi-closingness replaces closingness. Properties of open mappings between shift spaces are investigated in detail. In particular, we show that a closing open (or constant-to-one) extension preserves the structure of a sofic shift.

Type
Research Article
Information
Ergodic Theory and Dynamical Systems , Volume 29 , Issue 4 , August 2009 , pp. 1257 - 1272
Copyright
Copyright © Cambridge University Press 2009

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]Blanchard, F. and Hansel, G.. Sofic constant-to-one extensions of subshifts of finite type. Proc. Amer. Math. Soc. 112 (1991), 259–265.CrossRefGoogle Scholar
[2]Boyle, M., Kitchens, B. and Marcus, B.. A note on minimal covers for sofic systems. Proc. Amer. Math. Soc. 95 (1985), 403–411.CrossRefGoogle Scholar
[3]Boyle, M. and Krieger, W.. Almost Markov and Shift Equivalent Sofic Systems (Lecture Notes in Mathematics, 1342). Springer, Berlin, 1988.CrossRefGoogle Scholar
[4]Boyle, M., Marcus, B. and Trow, P.. Resolving maps and the dimension group for shifts of finite type. Mem. Amer. Math. Soc. 377 (1987).Google Scholar
[5]Coven, E. and Paul, M.. Finite procedures for sofic systems. Monatsh. Math. 83 (1977), 265–278.Google Scholar
[6]Fiebig, D.. Constant-to-one extensions of shifts of finite type. Proc. Amer. Math. Soc. 124 (1996), 2917–2922.CrossRefGoogle Scholar
[7]Hedlund, G. A.. Endomorphisms and automorphisms of the shift dynamical system. Math. Syst. Theory 3 (1969), 320–375.CrossRefGoogle Scholar
[8]Kitchens, B.. Symbolic Dynamics: One-sided, Two-sided and Countable State Markov Shifts. Springer, Berlin, 1998.CrossRefGoogle Scholar
[9]Kůrka, P.. Topological and Symbolic Dynamics (Cours Spécialisés, 11). Société Mathématique de France, Paris, 2003.Google Scholar
[10]Lind, D. and Marcus, B.. An Introduction to Symbolic Dynamics and Coding. Cambridge University Press, Cambridge, 1995.CrossRefGoogle Scholar
[11]Nasu, M.. Constant-to-one and onto global maps of homomorphisms between strongly connected graphs. Ergod. Th. & Dynam. Sys. 3 (1983), 387–413.CrossRefGoogle Scholar
[12]Walters, P.. An Introduction to Ergodic Theory. Springer, Berlin, 1982.CrossRefGoogle Scholar