Freeness of partial words
From MaRDI portal
Publication:2465643
DOI10.1016/j.tcs.2007.09.028zbMath1154.68457OpenAlexW2074547893MaRDI QIDQ2465643
Publication date: 7 January 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.09.028
Related Items
On the aperiodic avoidability of binary patterns with variables and reversals, Squareable Words, Computing Depths of Patterns, Periodicity algorithms and a conjecture on overlaps in partial words, Avoiding Abelian squares in partial words, Abelian repetitions in partial words, An algorithmic toolbox for periodic partial words, Avoiding large squares in partial words, Square-free partial words, On the number of squares in partial words, Square-Free Partial Words with Many Wildcards, Regular languages of partial words, An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms, A generalization of Thue freeness for partial words, Overlap-freeness in infinite partial words, Ternary Square-Free Partial Words with Many Wildcards, Avoidable binary patterns in partial words
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Codes, orderings, and partial words
- Partial words and a theorem of Fine and Wilf
- Partial words and the critical factorization theorem
- Uniformly growing k-th power-free homomorphisms
- Primitive partial words
- Suffix Arrays: A New Method for On-Line String Searches
- Restorations of punctured languages and similarity of languages
- Automatic Sequences
- Jewels of Stringology
- Partial words and the interaction property of periods
- DNA Computing
- Partial words and a theorem of Fine and Wilf revisited
