The following pages link to (Q3396591):
Displayed 27 items.
- Abelian powers and repetitions in Sturmian words (Q287434) (← links)
- A note on easy and efficient computation of full abelian periods of a word (Q313772) (← links)
- Fast algorithms for abelian periods in words and greatest common divisor queries (Q340577) (← links)
- Abelian-primitive partial words (Q388787) (← links)
- Algorithms for computing abelian periods of words (Q496544) (← links)
- Weak abelian periodicity of infinite words (Q504987) (← links)
- Relations on words (Q505060) (← links)
- Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings (Q507391) (← links)
- An abelian periodicity lemma (Q507407) (← links)
- Fast computation of abelian runs (Q507408) (← links)
- Disjunctivity and other properties of sets of pseudo-bordered words (Q530214) (← links)
- An extension of the Lyndon-Schützenberger result to pseudoperiodic words (Q716329) (← links)
- On a special class of primitive words (Q844893) (← links)
- Periodicity properties on partial words (Q948072) (← links)
- A periodicity lemma for partial words (Q2113379) (← links)
- Abelian periods of factors of Sturmian words (Q2187128) (← links)
- On highly palindromic words: the \(n\)-ary case (Q2231750) (← links)
- Abelian closures of infinite binary words (Q2237936) (← links)
- String periods in the order-preserving model (Q2288212) (← links)
- Abelian borders in binary words (Q2449116) (← links)
- String Periods in the Order-Preserving Model (Q3304137) (← links)
- On a Special Class of Primitive Words (Q3599133) (← links)
- An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words (Q3637224) (← links)
- (Q5016359) (← links)
- Abelian Repetitions in Sturmian Words (Q5300843) (← links)
- Abelian combinatorics on words: a survey (Q6101322) (← links)
- Dyck Words, Lattice Paths, and Abelian Borders (Q6114866) (← links)