Skip to main content
SpringerLink
Log in

Computing the Partial Word Avoidability Indices of Ternary Patterns

  • Conference paper
Book cover Combinatorial Algorithms (IWOCA 2012)

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

Included in the following conference series:

Abstract

We study pattern avoidance in the context of partial words. The problem of classifying the avoidable unary patterns has been solved, so we move on to binary, ternary, and more general patterns. Our results, which are based on morphisms (iterated or not), determine all the ternary patterns’ avoidability indices or at least give bounds for them.

This material is based upon work supported by the National Science Foundation under Grant No. DMS–1060775. We thank Sean Simmons from the Massachusetts Institute of Technology for his very valuable comments and suggestions.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bean, D.R., Ehrenfeucht, A., McNulty, G.: Avoidable patterns in strings of symbols. Pacific Journal of Mathematics 85, 261–294 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  2. Blanchet-Sadri, F.: Algorithmic Combinatorics on Partial Words. Chapman & Hall/CRC Press, Boca Raton, FL (2008)

    MATH  Google Scholar 

  3. Blanchet-Sadri, F., Black, K., Zemke, A.: Unary Pattern Avoidance in Partial Words Dense with Holes. In: Dediu, A.-H., Inenaga, S., Martín-Vide, C. (eds.) LATA 2011. LNCS, vol. 6638, pp. 155–166. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  4. Blanchet-Sadri, F., Mercaş, R., Simmons, S., Weissenstein, E.: Avoidable binary patterns in partial words. Acta Informatica 48(1), 25–41 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  5. Blanchet-Sadri, F., Mercaş, R., Simmons, S., Weissenstein, E.: Erratum to: Avoidable binary patterns in partial words. Acta Informatica 49, 53–54 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  6. Cassaigne, J.: Unavoidable binary patterns. Acta Informatica 30, 385–395 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  7. Cassaigne, J.: Motifs évitables et régularités dans les mots. PhD thesis, Paris VI (1994)

    Google Scholar 

  8. Clark, R.J.: The existence of a pattern which is 5-avoidable but 4-unavoidable. International Journal of Algebra and Computation 16, 351–367 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  9. Lothaire, M.: Algebraic Combinatorics on Words. Cambridge University Press, Cambridge (2002)

    MATH  Google Scholar 

  10. Ochem, P.: A generator of morphisms for infinite words. RAIRO-Theoretical Informatics and Applications 40, 427–441 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  11. Zimin, A.I.: Blocking sets of terms. Mathematics of the USSR-Sbornik 47, 353–364 (1984)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of North Carolina, P.O. Box 26170, Greensboro, NC, 27402–6170, USA

    Francine Blanchet-Sadri

  2. Department of Mathematics, Mathematics Building, University of Maryland, College Park, MD, 20742, USA

    Andrew Lohr

  3. School of Mathematics, Georgia Institute of Technology, 686 Cherry Street, Atlanta, GA, 30332–0160, USA

    Shane Scott

Authors
  1. Francine Blanchet-Sadri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrew Lohr
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shane Scott
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Kalasalingam University, Anand Nagar, 626 126, Krishanakoil, Tamil Nadu, India

    S. Arumugam

  2. Algorithms Research Group, Department of Computing & Software, McMaster University, L8S 4K1, Hamilton, ON, Canada

    W. F. Smyth

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Blanchet-Sadri, F., Lohr, A., Scott, S. (2012). Computing the Partial Word Avoidability Indices of Ternary Patterns. In: Arumugam, S., Smyth, W.F. (eds) Combinatorial Algorithms. IWOCA 2012. Lecture Notes in Computer Science, vol 7643. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35926-2_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35926-2_23

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation