Skip to main content
SpringerLink
Log in

Overlap free words on two symbols

  • 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. Brandenburg, Uniformly growing k-th power free homomorphism, Theoretical Computer Science, 23 (1983) 69–82.

    Google Scholar 

  2. M. Lothaire, Combinatorics on words, Addison-Wesley (1983).

    Google Scholar 

  3. A. Restivo, S. Salemi, On weakly square free words, Bulletin of EATCS, 21 (1983) 49–56.

    Google Scholar 

  4. R. Shelton, R. Soni, Aperiodic words on three symbols, III, J. reine angew Math. 330 (1982) 44–52.

    Google Scholar 

  5. A. Thue, Uber unendliche Zeichernereihen, Norske Vid. Selsk. Skr; I, Mat. Nat. Kl. Christiana 7 (1906) 1–22.

    Google Scholar 

  6. A. Thue, Uber die gegenseitige Lage gleicher Teile gewisser Zeichernreihen, Norske Vid. Selsk. Skr. I, Mat. Nat. Kl. Christiana 1 (1912) 1–67.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Istituto di Matematica, Università di Palermo, Italy

    Antonio Restivo & Sergio Salemi

Authors
  1. Antonio Restivo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sergio Salemi
    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

Restivo, A., Salemi, S. (1985). Overlap free words on two symbols. 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_35

Download citation

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

  • 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