Pages that link to "Item:Q496544"
From MaRDI portal
The following pages link to Algorithms for computing abelian periods of words (Q496544):
Displaying 8 items.
- 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)
- Computing regularities in strings: a survey (Q1761494) (← links)
- On highly palindromic words: the \(n\)-ary case (Q2231750) (← links)
- String periods in the order-preserving model (Q2288212) (← links)
- String Periods in the Order-Preserving Model (Q3304137) (← links)
- Dyck Words, Lattice Paths, and Abelian Borders (Q6114866) (← links)
