Skip to main content
SpringerLink
Log in

l-occurrences of avoidable patterns

  • Automata And Formal Languages
  • Conference paper
  • First Online:
STACS 91 (STACS 1991)

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

Included in the following conference series:

  • 113 Accesses

Abstract

In this paper the concept of l-occurrences of patterns is introduced. Given a word w∈Σ*, we say that w contains a l-occurrence of a pattern p∈E* iff there exists a morphism h : E*→Σ* such that h(p) is a factor of w and |h(a)|≥l for all a∈Σ.

We prove that a pattern p is avoidable iff there exists an infinite binary word that contains no l-occurrence of p for some l.

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. K. A. Baker, G. F. McNulty and W. Taylor, Growth Problems for Avoidable Words, Theoret. Comput. Sci. 69 (1989) 319–345.

    Article  Google Scholar 

  2. D. R. Bean, A. Ehrenfeucht, G. F. McNulty, Avoidable Patterns in Strings of Symbols, Pacific J. Math. 85 (1979) 261–294.

    Google Scholar 

  3. J. Cassaigne, personal communication, 1990

    Google Scholar 

  4. A.G. Dalalyan, Word eliminability, Dokl. Akad. Nauk Armen. SSR 78 (4) (1984) 156–158.

    Google Scholar 

  5. R. Entringer, D. Jackson and J. Schatz, On Nonrepetitive Sequences, J. Comb. Theory, Ser. A 16 (1974) 159–164.

    Article  Google Scholar 

  6. M. Lothaire, Combinatorics on Words (Addison-Wesley, Reading, MA, 1983).

    Google Scholar 

  7. P. Roth, Every Binary Pattern of Length Six is Avoidable on the Two-Letter Alphabet, Technical Report 6/89, Universität Frankfurt, submitted to Acta Informatica.

    Google Scholar 

  8. D. Sankoff & J.B. Kruskal (eds.), Time Warps, String Edits, and Macromolecules (Addison-Wesley, Reading, MA, 1983)

    Google Scholar 

  9. U. Schmidt, Avoidable Patterns on 2 Letters, Theoret. Comput. Sci. 63 (1989) 1–17.

    Article  Google Scholar 

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

    Google Scholar 

  11. A. I. Zimin, Blocking set of terms, in: Fifteenth All-Union Algebra Conference, Abstract of Reports, Part I (Gos. Univ., Krasnoyarsk, 1979) 63 (in Russian)

    Google Scholar 

  12. A. I. Zimin, Blocking Sets of Terms, Matem. Sbornik 119 (1982); English translation Math. USSR Sbornik 47 (1984) 353–364

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik, Johann Wolfgang Goethe-Universität, D - 6000, Frankfurt am Main, Federal Republic of Germany

    Peter Roth

Authors
  1. Peter Roth
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Christian Choffrut Matthias Jantzen

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Roth, P. (1991). l-occurrences of avoidable patterns. In: Choffrut, C., Jantzen, M. (eds) STACS 91. STACS 1991. Lecture Notes in Computer Science, vol 480. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020786

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53709-0

  • Online ISBN: 978-3-540-47002-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation