The following pages link to (Q4351065):
Displaying 14 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)
- \(k\)-abelian pattern matching (Q491150) (← links)
- Algorithms for computing abelian periods of words (Q496544) (← links)
- Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings (Q507391) (← 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)
- A characterization of the squares in a Fibonacci string (Q1392029) (← links)
- Weak repetitions in Sturmian strings. (Q1401224) (← links)
- Repetitive perhaps, but certainly not boring (Q1583539) (← links)
- Computing regularities in strings: a survey (Q1761494) (← links)
- An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words (Q3637224) (← links)
- Abelian Repetitions in Sturmian Words (Q5300843) (← links)