Computing depths of patterns

DOI10.1051/ITA/2016014MaRDI QIDQ2953688zbMATH OpenOpenAlexFDO

Authors Andrew Lohr, F. 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

zbMATH Keywords

depth of patternpartial wordpattern avoidanceunavoidable pattern

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• Computing Depths of Patterns
• Abelian pattern avoidance in partial words
• Strict bounds for pattern avoidance
• Strict bounds for pattern avoidance
• Abelian pattern avoidance in partial words

Cites work

• A generator of morphisms for infinite words
• Abelian pattern avoidance in partial words
• Application of entropy compression in pattern avoidance
• Avoidable binary patterns in partial words
• Avoidable patterns in strings of symbols
• BLOCKING SETS OF TERMS
• Computing Depths of Patterns
• Computing the partial word avoidability indices of binary patterns
• Computing the partial word avoidability indices of ternary patterns
• Freeness of partial words
• scientific article; zbMATH DE number 1024080 (Why is no real title available?)
• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• Pattern avoidance in partial words over a ternary alphabet
• Pattern avoidance: themes and variations
• Strict bounds for pattern avoidance
• Unary Pattern Avoidance in Partial Words Dense with Holes

Cited in

(4)

• Revisiting Shinohara's algorithm for computing descriptive patterns
• Avoidable binary patterns in partial words
• Computing Depths of Patterns
• Avoidable binary patterns in partial words

This page was built for publication: Computing depths of patterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2953688)