Acta Informatica

, Volume 48, Issue 1, pp 25–41

Avoidable binary patterns in partial words

Authors

    • Department of Computer ScienceUniversity of North Carolina
  • Robert Mercaş
    • GRLMC, Departament de Filologies RomàniquesUniversitat Rovira i Virgili
  • Sean Simmons
    • Department of MathematicsThe University of Texas at Austin
  • Eric Weissenstein
    • Department of Mathematical SciencesRensselaer Polytechnic Institute
Original Article

DOI: 10.1007/s00236-010-0129-0

Cite this article as:
Blanchet-Sadri, F., Mercaş, R., Simmons, S. et al. Acta Informatica (2011) 48: 25. doi:10.1007/s00236-010-0129-0

Abstract

The problem of classifying all the avoidable binary patterns in (full) words has been completely solved (see Chap. 3 of M. Lothaire, Algebraic Combinatorics on Words, Cambridge University Press, 2002). In this paper, we classify all the avoidable binary patterns in partial words, or sequences that may have some undefined positions called holes. In particular we show that, if we do not substitute any variable of the pattern by a partial word consisting of only one hole, the avoidability index of the pattern remains the same as in the full word case.

Copyright information

© Springer-Verlag 2010