Sciweavers

Share
LATA
2010
Springer

Avoidable Binary Patterns in Partial Words

9 years 3 months ago
Avoidable Binary Patterns in Partial Words
The problem of classifying all the avoidable binary patterns in words has been completely solved (see Chapter 3 of M. Lothaire, Algebraic Combinatorics on Words, Cambridge University Press, 2002). Partial words represent sequences that may have some undefined positions called holes. In this paper, we show that, if we do not substitute any variable of the pattern by a trivial partial word consisting of only one hole, the avoidability index of the pattern remains the same as in the full word case.
Francine Blanchet-Sadri, Robert Mercas, Sean Simmo
Added 08 Sep 2010
Updated 08 Sep 2010
Type Conference
Year 2010
Where LATA
Authors Francine Blanchet-Sadri, Robert Mercas, Sean Simmons, Eric Weissenstein
Comments (0)
books