Abelian-primitive partial words
From MaRDI portal
Publication:388787
DOI10.1016/J.TCS.2013.03.007zbMATH Open1296.68114OpenAlexW2084121245MaRDI QIDQ388787FDOQ388787
Authors: Nathan Fox, F. 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
Recommendations
Cites Work
- Title not available (Why is that?)
- Primitive partial words
- Title not available (Why is that?)
- On a special class of primitive words
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fundamental gaps of numerical semigroups generated by two elements.
- Algorithms for computing abelian periods of words
- Algorithmic Combinatorics on Partial Words
- Avoiding Abelian squares in partial words
- Partial words and a theorem of Fine and Wilf
- Counting abelian squares
- Counting primitive partial words
- Abelian Primitive Words
- Abelian periods, partial words, and an extension of a theorem of Fine and Wilf
- Abelian repetitions in partial words
- Testing primitivity on partial words
Cited In (8)
Uses Software
This page was built for publication: Abelian-primitive partial words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q388787)