A generalization of Thue freeness for partial words
From MaRDI portal
Publication:1006051
DOI10.1016/j.tcs.2008.11.006zbMath1162.68029OpenAlexW2020326682MaRDI QIDQ1006051
Geoffrey Scott, Robert Mercaş, Francine Blanchet-Sadri
Publication date: 17 March 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: http://libres.uncg.edu/ir/uncg/f/F_Blanchet-Sadri_Generalization_2009.pdf
Related Items
On the aperiodic avoidability of binary patterns with variables and reversals ⋮ Clusters of repetition roots: single chains ⋮ Squareable Words ⋮ Periodicity algorithms and a conjecture on overlaps in partial words ⋮ Avoiding Abelian squares in partial words ⋮ Abelian repetitions in partial words ⋮ Avoiding large squares in partial words ⋮ Square-Free Partial Words with Many Wildcards ⋮ An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms ⋮ Ternary Square-Free Partial Words with Many Wildcards ⋮ Avoidable binary patterns in partial words ⋮ How to play Thue games
Cites Work
- Unnamed Item
- Avoiding large squares in infinite binary words
- Avoidable patterns in strings of symbols
- Partial words and a theorem of Fine and Wilf
- How many squares must a binary sequence contain?
- On Dejean's conjecture over large alphabets
- Freeness of partial words
- Sur un théorème de Thue
- ALGORITHMIC COMBINATORICS ON PARTIAL WORDS
