Computing the Partial Word Avoidability Indices of Ternary Patterns

UNCG Author/Contributor (non-UNCG co-authors, if there are any, appear on document)
Francine Blanchet-Sadri, Professor (Creator)
The University of North Carolina at Greensboro (UNCG )
Web Site:

Abstract: We study pattern avoidance in the context of partial words. The problem of classifying the avoidable binary patterns has been solved, so we move on to 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.

Additional Information

Journal of Discrete Algorithms, 23, 119-142
Language: English
Date: 2013
Combinatorics on words, Partial words, Pattern avoidance, Ternary pattern, Avoidability index

Email this document to