论文信息 - Computing the Partial Word Avoidability Indices of Ternary Patterns

Computing the Partial Word Avoidability Indices of Ternary Patterns

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.

Francine Blanchet-Sadri | Andrew Lohr | Shane Scott

[1] Dwight R. Bean,et al. Avoidable patterns in strings of symbols , 1979 .

[2] Julien Cassaigne,et al. Unavoidable binary patterns , 1993, Acta Informatica.

[3] A. Zimin. BLOCKING SETS OF TERMS , 1984 .

[4] Julien Cassaigne. Motifs evitables et regularites dans les mots , 1994 .

[5] Francine Blanchet-Sadri,et al. Erratum to: Avoidable binary patterns in partial words , 2011, Acta Informatica.

[6] Francine Blanchet-Sadri,et al. Unary Pattern Avoidance in Partial Words Dense with Holes , 2011, LATA.

[7] Francine Blanchet-Sadri. Algorithmic Combinatorics on Partial Words , 2012, Int. J. Found. Comput. Sci..

[8] Francine Blanchet-Sadri,et al. Avoidable binary patterns in partial words , 2010, Acta Informatica.

[9] Ronald J. Clark,et al. The Existence of a Pattern Which Is 5-avoidable but 4-unavoidable , 2006, Int. J. Algebra Comput..

[10] M. Lothaire. Algebraic Combinatorics on Words , 2002 .

[11] M. Lothaire,et al. Algebraic Combinatorics on Words: Index of Notation , 2002 .

[12] Pascal Ochem,et al. A generator of morphisms for infinite words , 2006, RAIRO Theor. Informatics Appl..