Abelian-primitive partial words
From MaRDI portal
Publication:388787
DOI10.1016/j.tcs.2013.03.007zbMath1296.68114OpenAlexW2084121245MaRDI QIDQ388787
Nathan Fox, Francine Blanchet-Sadri
Publication date: 7 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.03.007
Uses Software
Cites Work
- Algorithms for computing abelian periods of words
- Avoiding Abelian squares in partial words
- Abelian repetitions in partial words
- On a special class of primitive words
- Testing primitivity on partial words
- Partial words and a theorem of Fine and Wilf
- Counting abelian squares
- Fundamental gaps of numerical semigroups generated by two elements.
- Primitive partial words
- Abelian Primitive Words
- Algorithmic Combinatorics on Partial Words
- Abelian periods, partial words, and an extension of a theorem of Fine and Wilf
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item