Computing Depths of Patterns
From MaRDI portal
Publication:2953688
DOI10.1051/ita/2016014zbMath1359.68237MaRDI QIDQ2953688
Andrew Lohr, Francine Blanchet-Sadri
Publication date: 5 January 2017
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ita/2016014
68R15: Combinatorics on words
Cites Work
- Unnamed Item
- Unnamed Item
- Strict bounds for pattern avoidance
- Computing the partial word avoidability indices of binary patterns
- Computing the partial word avoidability indices of ternary patterns
- Application of entropy compression in pattern avoidance
- Pattern avoidance: themes and variations
- Avoidable binary patterns in partial words
- Avoidable patterns in strings of symbols
- Freeness of partial words
- Pattern avoidance in partial words over a ternary alphabet
- Abelian pattern avoidance in partial words
- Unary Pattern Avoidance in Partial Words Dense with Holes
- A generator of morphisms for infinite words
- BLOCKING SETS OF TERMS
- Computing Depths of Patterns