Hostname: page-component-6898cfcb55-kwdml Total loading time: 0 Render date: 2026-11-12T00:03:55.112Z Has data issue: false hasContentIssue false
  • English
  • Français

Extensions à fibre constante

Published online by Cambridge University Press:  19 September 2008

F. Blanchard
F. Blanchard
Affiliation:
UER de Mathématiques, Université de Provence, 3 place Victor Hugo, 13331 Marseille Cedex 3, France
Get accessRights & Permissions [Opens in a new window]

Abstract

The aim of this paper is to prove that any transitive constant-to-one extension of a coded system is still coded. The corresponding statement for sofic systems is false, and it is an open question whether it is true for subshifts of finite type.

Information

Type
Research Article
Information
Ergodic Theory and Dynamical Systems , Volume 11 , Issue 1 , March 1991, pp. 7 - 17
Copyright
Copyright © Cambridge University Press 1991

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.)

Article purchase

Temporarily unavailable

References

REFERENCES

[BH]Blanchard, F. & Hansel, G.. Systèmes codés. Theor. Comput. Sci. 44 (1986) 17–49.CrossRefGoogle Scholar
[BMT]Boyle, M., Marcus, B. & Trow, P.. Resolving maps and the dimension group for subshifts of finite type. Memoirs Amer. Math. Soc. 70 (1987), 377.CrossRefGoogle Scholar
[H]Hansel, G.. Communication personnelle.Google Scholar
[K]Kitchens, B.. PhD Thesis, University of N. Carolina, Chapel Hill NC, 1981.Google Scholar
[Kr]Krieger, W.. On subshifts and topological Markov chains. Preprint.Google Scholar
[N]Nasu, M.. Constant-to-one and onto global maps of homomorphisms between strongly connected graphs. Ergod. Th. & Dynam. Sys. 3 (1983) 387–414.CrossRefGoogle Scholar
[P]Parry, W.. A finitary classification of topological Markov chains and sofic systems. Bull. London Math. Soc. 9 (1977) 86–92.CrossRefGoogle Scholar
[R1]Rudolph, D.. If a two-point extension of a Bernoulli shift has an ergodic square, then it is Bernoulli. Israel J. Math. 30 (1978) 159–180.CrossRefGoogle Scholar
[R2]Rudolph, D.. If a finite extension of a Bernoulli shift has no finite rotation factors, it is Bernoulli. Israel J. Math. 30 (1978) 193–206.CrossRefGoogle Scholar
[W]Weiss, B.. Subshifts of finite type and sofic systems. Monatsh. Math. 77 (1973) 462–474.CrossRefGoogle Scholar