Skip to main content
SpringerLink
Log in

Languages and subshifts

  • Part IV Topological Aspects Of Automata On Infinite Words
  • Conference paper
  • First Online:
Automata on Infinite Words (LITP 1984)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 192))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliographie

  1. DENKER M., GRILLENBERGER C. SIGMUND K. Ergodic theory on compact spaces Lecture notes in Math. 527 Berlin-Heidelberg-New York: Springer 1976.

    Google Scholar 

  2. FISCHER R. Sofic systems and graphs Monats. Math. 80, 179–186 (1975)

    Google Scholar 

  3. KRIEGER W. On unique ergodicity Proc. 6 th Berkeley Symp. on Math. Stat. and Probability, Berkeley, L.A., Un. of California Press I, 327–346 (1972).

    Google Scholar 

  4. RUDOLPH, D. A mixing Markov chain with exponentially decaying return time is finitarily Bernoulli. Ergodic Th. and Dynamical Systems 2, 85–97 (1982).

    Google Scholar 

  5. WEISS, B. Subshifts of finite type and sofic systems Monastsh. Math. 77, 462–474 (1973).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire de Probabilité, UNIVERSITE DE PARIS VI, France

    F. Blanchard & G. Hansel

  2. Faculté des Sciences Laboratoire d'Informatique L.I.T.P, UNIVERSITE DE HAUTE NORMANDIE, France

    F. Blanchard & G. Hansel

Authors
  1. F. Blanchard
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Hansel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. Nivat D. Perrin

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Blanchard, F., Hansel, G. (1985). Languages and subshifts. In: Nivat, M., Perrin, D. (eds) Automata on Infinite Words. LITP 1984. Lecture Notes in Computer Science, vol 192. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15641-0_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-15641-0_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15641-3

  • Online ISBN: 978-3-540-39505-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation