Square-Free Partial Words with Many Wildcards

DOI10.1142/S0129054118420078zbMath1408.68123OpenAlexW2888311326WikidataQ129353815 ScholiaQ129353815MaRDI QIDQ4683234

Arseny M. Shur, Daniil Gasnikov

Publication date: 20 September 2018

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054118420078

zbMATH Keywords

partial wordsquare-free wordletter density

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On ternary square-free circular words
• Square-free partial words
• A generalization of Thue freeness for partial words
• Partial words and a theorem of Fine and Wilf
• Freeness of partial words
• Sur un théorème de Thue
• Avoiding letter patterns in ternary square-free words
• Ternary Square-Free Partial Words with Many Wildcards
• Constructing Premaximal Ternary Square-Free Words of Any Level
• Unary Pattern Avoidance in Partial Words Dense with Holes
• On the Tree of Ternary Square-Free Words
• Partial words and a theorem of Fine and Wilf revisited

This page was built for publication: Square-Free Partial Words with Many Wildcards