Pages that link to "Item:Q442242"
From MaRDI portal
The following pages link to Periodicity algorithms and a conjecture on overlaps in partial words (Q442242):
Displaying 15 items.
- An algorithmic toolbox for periodic partial words (Q477348) (← links)
- On the context-freeness of the set of words containing overlaps (Q845966) (← links)
- Overlap-freeness in infinite partial words (Q1006076) (← links)
- Border correlations, lattices, and the subgraph component polynomial (Q1678101) (← links)
- Computing primitively-rooted squares and runs in partial words (Q1678102) (← links)
- Periods in partial words: an algorithm (Q1932359) (← links)
- A periodicity lemma for partial words (Q2113379) (← links)
- Computing Primitively-Rooted Squares and Runs in Partial Words (Q2946044) (← links)
- (Q3442580) (← links)
- Squareable Words (Q3451095) (← links)
- An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms (Q3618580) (← links)
- Algorithmics of Posets Generated by Words Over Partially Commutative Alphabets (Extended Version) (Q4621173) (← links)
- (Q5203010) (← links)
- (Q5227519) (← links)
- Periodicity in data streams with wildcards (Q5915573) (← links)