Pages that link to "Item:Q4923285"
From MaRDI portal
The following pages link to IDENTIFYING ALL ABELIAN PERIODS OF A STRING IN QUADRATIC TIME AND RELEVANT PROBLEMS (Q4923285):
Displayed 6 items.
- A note on easy and efficient computation of full abelian periods of a word (Q313772) (← links)
- Weak abelian periodicity of infinite words (Q504987) (← links)
- Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings (Q507391) (← links)
- On highly palindromic words: the \(n\)-ary case (Q2231750) (← links)
- Abelian borders in binary words (Q2449116) (← links)
- Abelian Repetitions in Sturmian Words (Q5300843) (← links)