Skip to main content
SpringerLink
Log in

Avoidable patterns on 2 letters

  • Contributed Papers
  • Conference paper
  • First Online:
STACS 87 (STACS 1987)

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

Included in the following conference series:

  • 131 Accesses

Abstract

We examine avoidable patterns, unavoidable in the sense of Bean, Ehrenfeucht, McNulty. We prove that each pattern on two letters of length at least 13 is avoidable on an alphabet with two letter. The proof is based essentially on two facts: First, each pattern containing an overlapping factor is avoidable by the infinite word of Thue-Morse; secondly, each pattern without overlapping factor is avoidable by the infinite word of Fibonacci.

This article was done while the author stayed at LITP, Université Pierre et Marie Curie, Paris

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. Bean D. R., Ehrenfeucht A., McNulty G. F.: Avoidable Patterns in Strings of Symbols. Pacific J. Math. 85, 261–294 (1979)

    Google Scholar 

  2. Berstel J. Sur les mots sans carré définis par un morphisme. Proc. of the Intern. Coll. on Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 71, pp. 16–25, Springer 1979

    Google Scholar 

  3. Berstel J.: Mots de Fibonacci. Séminaire d'Informatique Théorique 1980–81, Rapport LITP, Paris

    Google Scholar 

  4. Berstel J.: Some recent results on square-free words. STACS 84, Lecture Notes in Computer Science, Vol. 166, pp. 14–25, Berlin-Heidelberg-New York: Springer 1984

    Google Scholar 

  5. Crochemore M.: Régularités évitables. Thèse d'Etat, Rapport LITP 83–43, Paris, 1983

    Google Scholar 

  6. Lothaire: Combinatorics on Words. Addison-Wesley 1984

    Google Scholar 

  7. Main M. G., Lorentz R. J.: An O(n log n) Algorithm for Finding All Repetitions in a String. J. Algorithms 5, 422–432 (1984)

    Google Scholar 

  8. Restivo A., Salemi S.: On Weakly Square-free Words. Bull. EATCS 21, 49–56 (1983)

    Google Scholar 

  9. Schmidt U.: Motifs inévitables dans les mots. Thèse de l`Université Pierre et Marie Curie (Paris 6), Rapport LITP, Paris, 1986

    Google Scholar 

  10. Séebold P.: Propriétés combinatoires des mots infinis engendrés par certains morphismes.

    Google Scholar 

  11. Thue A.: Über unendliche Zeichenreihen. Norske Vid. Selsk. Skr., I. Mat. Nat. Kl., Christiania, 7, 1–22 (1906)

    Google Scholar 

  12. Thue A. Über die gegenseitige Lage gleicher Teile gewisser Zeichenreihen. Norske Vid. Selsk. Skr., I. Mat. Nat. Kl., Christiania, 1, 1–67 (1912)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Angewandte Informatik und Formale Beschreibungsverfahren, Universität Karlsruhe, Postfach 6980, 7500, Karlsruhe, West-Germany

    Ursula Schmidt

Authors
  1. Ursula Schmidt
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Franz J. Brandenburg Guy Vidal-Naquet Martin Wirsing

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schmidt, U. (1987). Avoidable patterns on 2 letters. In: Brandenburg, F.J., Vidal-Naquet, G., Wirsing, M. (eds) STACS 87. STACS 1987. Lecture Notes in Computer Science, vol 247. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039606

Download citation

  • DOI: https://doi.org/10.1007/BFb0039606

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17219-2

  • Online ISBN: 978-3-540-47419-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation