Pages that link to "Item:Q1884922"
From MaRDI portal
The following pages link to Local periods and binary partial words: an algorithm (Q1884922):
Displaying 21 items.
- Periodicity algorithms and a conjecture on overlaps in partial words (Q442242) (← links)
- An algorithmic toolbox for periodic partial words (Q477348) (← links)
- Two fast constructions of compact representations of binary words with given set of periods (Q507396) (← links)
- A periodicity result of partial words with one hole (Q597324) (← links)
- Local languages and the Berry-Sethi algorithm (Q672153) (← links)
- Linear-time computation of local periods (Q703549) (← links)
- Codes, orderings, and partial words (Q706621) (← links)
- Blocksequences of \(k\)-local words (Q831795) (← links)
- Testing primitivity on partial words (Q868383) (← links)
- Periodicity properties on partial words (Q948072) (← links)
- Combinatorics on partial word correlations (Q986100) (← links)
- Border correlations, lattices, and the subgraph component polynomial (Q1678101) (← links)
- Partial words and the critical factorization theorem (Q1770435) (← links)
- Periods in partial words: an algorithm (Q1932359) (← links)
- Partial words and the critical factorization theorem revisited (Q2456370) (← links)
- Relational codes of words (Q2465641) (← links)
- Defect theorems with compatibility relations. (Q2480767) (← links)
- Primitive partial words (Q2486065) (← links)
- Equations on partial words (Q3549287) (← links)
- The theorem of Fine and Wilf for relational periods (Q3625689) (← links)
- (Q5203010) (← links)