Periodicity algorithms and a conjecture on overlaps in partial words
From MaRDI portal
Publication:442242
DOI10.1016/J.TCS.2012.03.034zbMATH Open1250.68216OpenAlexW2081720934WikidataQ123029512 ScholiaQ123029512MaRDI QIDQ442242FDOQ442242
Authors: Robert Mercaş, Abraham Rashin, Elara Willett, F. Blanchet-Sadri 
Publication date: 10 August 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.03.034
Recommendations
- An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms
- Overlap-freeness in infinite partial words
- Periodicity algorithms for partial words
- An algorithmic toolbox for periodic partial words
- Local periods and binary partial words: an algorithm
- On periodicity lemma for partial words
- Periodicity on partial words
- A periodicity lemma for partial words
- Length-\(k\)-overlap-free binary infinite words
- Partial words and a theorem of Fine and Wilf revisited
Cites Work
- Title not available (Why is that?)
- Automatic Sequences
- Square-free partial words
- All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings
- A generalization of Thue freeness for partial words
- Overlap-freeness in infinite partial words
- Freeness of partial words
- Periodicity algorithms for partial words
- An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms
Cited In (16)
- An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithmics of Posets Generated by Words Over Partially Commutative Alphabets (Extended Version)
- Periodicity in data streams with wildcards
- An algorithmic toolbox for periodic partial words
- Overlap-freeness in infinite partial words
- Title not available (Why is that?)
- On the context-freeness of the set of words containing overlaps
- Border correlations, lattices, and the subgraph component polynomial
- Computing primitively-rooted squares and runs in partial words
- Computing primitively-rooted squares and runs in partial words
- Periodicity algorithms for partial words
- Periods in partial words: an algorithm
- A periodicity lemma for partial words
- Squareable words
This page was built for publication: Periodicity algorithms and a conjecture on overlaps in partial words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442242)
