Hostname: page-component-848d4c4894-xfwgj Total loading time: 0 Render date: 2024-07-01T07:50:25.236Z Has data issue: false hasContentIssue false

Almost topological classification of finite-to-one factor maps between shifts of finite type

Published online by Cambridge University Press:  19 September 2008

Roy Adler
Affiliation:
IBM Research Laboratory, Yorktown Heights, New York 10598, USA
Bruce Kitchens
Affiliation:
IBM Research Laboratory, Yorktown Heights, New York 10598, USA
Brian Marcus
Affiliation:
IBM Research Laboratory, San Jose, California 95193, USA and University of North Carolina, Chapel Hill, North Carolina 27514, USA
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We classify finite-to-one factor maps between shifts of finite type up to almost topological conjugacy.

Type
Research Article
Copyright
Copyright © Cambridge University Press 1985

References

REFERENCES

[1]Adler, R., Kitchens, B. & Marcus, B.. Finite group actions on shifts of finite type. Ergod. Th. & Dynam. Sys. 5 (1985), 125.CrossRefGoogle Scholar
[2]Adler, R. & Marcus, B.. Topological entropy and equivalence of dynamical systems. Mem. Amer. Math. Soc. 20 (1979), #219.Google Scholar
[3]Coven, E. & Paul, M.. Endomorphisms of irreducible subshifts of finite type. Math. Systems Theory 8 (1974), 167175.CrossRefGoogle Scholar
[4]Coven, E. & Paul, M.. Finite procedures for sofic systems. Monats. Math. 83 (1977), 265278.Google Scholar
[5]Hedlund, G. A.. Endomorphisms and automorphisms of the shift dynamical system. Math. Systems Theory 3 (1969), 320375.CrossRefGoogle Scholar
[6]Livshits, A. N.. Homology properties of Y-systems. Mathematical Notes of Academy of Sciences USSR 10 (1971), 751763.Google Scholar
[7]Marcus, B.. Factors and extensions of full shifts. Monats. Math. 88 (1979), 239247.CrossRefGoogle Scholar
[8]Nasu, M.. Constant-to-one and onto global maps of homomorphisms between strongly connected graphs. Ergod. Th. & Dynam. Sys. 3 (1983), 387414.CrossRefGoogle Scholar
[9]Parry, W. & Tuncel, S.. Classification Problems in Ergodic Theory. London Math. Soc. Lecture Series #67, Cambridge University Press, 1982.CrossRefGoogle Scholar
[10]Rudolph, D.. Counting the relatively finite factors of a Bernoulli shift. Israel J. Math. 30 (1978), 255263.CrossRefGoogle Scholar