Skip to main content
SpringerLink
Log in

Overlap-free sequences

  • Part V Iterated Morphisms And 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.

References

  1. F. J. BRANDENBURG: Uniformly growing k-th power-free homoorphisms. Theor. Comput. Science 23 (1983), p.69–82.

    Google Scholar 

  2. E. D. FIFE: Binary sequences which contain no BBb. Trans. Amer. Math. Society 261 (1) (1980), p. 115–136.

    Google Scholar 

  3. W. GOTTSCHALK-G. HEDLUND: "Topological Dynamics". Amer. Math. Soc. Colloq. Pub. Vol.36 (1955).

    Google Scholar 

  4. T. HARJU: Morphisms that avoid overlapping. University of Turku (1983).

    Google Scholar 

  5. G. HEDLUND: Remarks of the work of Axel Thue on sequences. Nord. Mat. Tidskr. 16 (1967), p.148–150.

    Google Scholar 

  6. J. KARHUMÄKI: On strongly cube-free w-words generated by binary morphisms. Springer Lecture Notes in Comp. Sci. 117 (1981), p.182–189.

    Google Scholar 

  7. M. MORSE-G. HEDLUND: Unending chess, symbolic dynamics and a problem in semi-group. Duke Math. J. 11 (1944), p.1–7.

    Google Scholar 

  8. J. J. PANSIOT: The MOrse sequence and iterated morphisms. Inf. Process. Letters 12 (1981), p.68–70.

    Google Scholar 

  9. A. RESTIVO-S. SALEMI: On weakly square-free words. Inf. Process. Letters — to appear.

    Google Scholar 

  10. P. SÉÉBOLD: Morphismes itérés, mot de Morse et mot de Fibonacci. C. R. Acad. Science 295 (1982), p.439–441.

    Google Scholar 

  11. A. THUE: Über die gegenseitige Lage gleicher Teile gewisser Zeichenreihen. Norske Vid. Selsk. Skr. I. Mat. Nat. Kl. Chris. 1 (1912) p.1–67.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. UER de Mathématiques, Université Paris VII, France

    Patrice Séébold

  2. Laboratoire d'Informatique Théorique et Programmation-LA 248 du CNRS, 2 Place Jussieu, 75221, PARIS Cedex 05, FRANCE

    Patrice Séébold

Authors
  1. Patrice Séébold
    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

Séébold, P. (1985). Overlap-free sequences. 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_36

Download citation

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

  • 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