Partial words and the critical factorization theorem
From MaRDI portal
Publication:1770435
DOI10.1016/j.jcta.2004.09.002zbMath1073.68067OpenAlexW2095479659MaRDI QIDQ1770435
S. Duncan, Francine Blanchet-Sadri
Publication date: 6 April 2005
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2004.09.002
Related Items
Testing primitivity on partial words ⋮ Partial words and the critical factorization theorem revisited ⋮ Equations on partial words ⋮ Relational codes of words ⋮ Freeness of partial words ⋮ Defect theorems with compatibility relations. ⋮ Primitive partial words ⋮ Combinatorics on partial word correlations ⋮ Border correlations of partial words ⋮ The theorem of Fine and Wilf for relational periods ⋮ Unbordered partial words
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A periodicity result of partial words with one hole
- Codes, orderings, and partial words
- Periods in strings
- Periodes et repetitions des mots du monoide libre
- Périodes locales et propagation de périodes dans un mot
- Partial words and a theorem of Fine and Wilf
- Periodicity on partial words
- Time-space-optimal string matching
- Conjugacy on partial words.
- Local periods and binary partial words: an algorithm
- Squares, cubes, and time-space efficient string searching
- Periods and binary words
- A fast string searching algorithm
- A periodicity theorem on words and applications
- A Space-Economical Suffix Tree Construction Algorithm
- Fast Pattern Matching in Strings
- A universal algorithm for sequential data compression
- Algorithms on Strings, Trees and Sequences
- Two-way string-matching
- Rotations of Periodic Strings and Short Superstrings
- Density of Critical Factorizations
- Uniqueness Theorems for Periodic Functions
- Recurrence and periodicity in infinite words from local periods
- Partial words and a theorem of Fine and Wilf revisited
