Skip to main content
SpringerLink
Log in

Non-constructive Methods for Avoiding Repetitions in Words

  • Conference paper
Combinatorics on Words

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8079))

  • 524 Accesses

Abstract

We survey several different non-constructive methods for showing the avoidability of certain kinds of repetitions in words.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 72.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Beck, J.: An application of Lovász local lemma: there exists an infinite 01-sequence containing no near identical intervals. In: Hajnal, A., et al. (eds.) Infinite and Finite Sets. Colloq. Math. Soc. J. Bolyai, vol. 37, pp.103–107 (1981)

    Google Scholar 

  2. Bell, J., Goh, T.L.: Lower bounds for pattern avoidance. Inform. and Comput. 205, 1295–1306 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  3. Blanchet-Sadri, F., Woodhouse, B.: Strict bounds for pattern avoidance (preprint)

    Google Scholar 

  4. Cassaigne, J.: Motifs évitables et régularités dans les mots. Thèse de doctorat, Université Paris 6, LITP research report TH 94–04

    Google Scholar 

  5. Grytczuk, J., Kozik, J., Micek, P.: New approach to nonrepetitive sequences. Random Structures Algorithms 42, 214–225 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  6. Miller, J.: Two notes on subshifts. Proc. Amer. Math. Soc. 140, 1617–1622 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  7. Moser, R.A., Tardos, G.: A constructive proof of the general Lovász local lemma. J. ACM 57, Art. 11 (2010)

    Google Scholar 

  8. Ochem, P., Pinlou, A.: Application of entropy compression in pattern avoidance. Preprint available at http://arxiv.org/abs/1301.1873

  9. Rowen, L.: Ring Theory. Vol. II. Pure and Applied Mathematics, vol. 128. Academic Press, Boston (1988)

    Google Scholar 

  10. Rumyantsev, A.Y., Ushakov, M.A.: Forbidden substrings, Kolmogorov complexity and almost periodic sequences. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 396–407. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  11. Thue, A.: Über unendliche Zeichenreihen. Kra. Vidensk. Selsk. Skrifter. I. Mat. Nat. Kl. 7, 1–22 (1906)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Statistics, University of Winnipeg, 515 Portage Ave., Winnipeg, MB, R3B 0M3, Canada

    Narad Rampersad

Authors
  1. Narad Rampersad
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and TUCS, University of Turku, 20014, Turku, Finland

    Juhani Karhumäki

  2. University of Turku, 20014, Turku, Finland

    Arto Lepistö

  3. FUNDIM, University of Turku, Finland

    Luca Zamboni

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rampersad, N. (2013). Non-constructive Methods for Avoiding Repetitions in Words. In: Karhumäki, J., Lepistö, A., Zamboni, L. (eds) Combinatorics on Words. Lecture Notes in Computer Science, vol 8079. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40579-2_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40579-2_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40578-5

  • Online ISBN: 978-3-642-40579-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation