Computing the partial word avoidability indices of ternary patterns

DOI10.1016/j.jda.2013.06.009zbMath1334.68167OpenAlexW4242115439MaRDI QIDQ396699

Shane Scott, Andrew Lohr, Francine Blanchet-Sadri

Publication date: 13 August 2014

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2013.06.009

zbMATH Keywords

pattern avoidancecombinatorics on wordsavoidability indexpartial wordsternary pattern

Mathematics Subject Classification ID

Combinatorics on words (68R15) Permutations, words, matrices (05A05)

Related Items

Computing Depths of Patterns

Cites Work

• Unnamed Item
• Unnamed Item
• Computing the partial word avoidability indices of binary patterns
• Avoidable binary patterns in partial words
• Avoidable patterns in strings of symbols
• Unavoidable binary patterns
• Computing the Partial Word Avoidability Indices of Ternary Patterns
• Unary Pattern Avoidance in Partial Words Dense with Holes
• A generator of morphisms for infinite words
• BLOCKING SETS OF TERMS
• Algorithmic Combinatorics on Partial Words
• THE EXISTENCE OF A PATTERN WHICH IS 5-AVOIDABLE BUT 4-UNAVOIDABLE