Pages that link to "Item:Q811134"
From MaRDI portal
The following pages link to Optimal superprimitivity testing for strings (Q811134):
Displayed 16 items.
- A work-time optimal algorithm for computing all string covers (Q671438) (← links)
- Quasiperiodic Sturmian words and morphisms (Q870835) (← links)
- Optimality of some algorithms to detect quasiperiodicities (Q986546) (← links)
- An on-line string superprimitivity test (Q1209376) (← links)
- Quasiperiodicity and string covering (Q1292493) (← links)
- Testing string superprimitivity in parallel (Q1318749) (← links)
- An optimal algorithm to compute all the covers of a string (Q1329417) (← links)
- Normal forms of quasiperiodic strings (Q1583537) (← links)
- Repetitive perhaps, but certainly not boring (Q1583539) (← links)
- An extension of the periodicity lemma to longer periods (Q1764895) (← links)
- Covering a string (Q1924404) (← links)
- Quasiperiodic and Lyndon episturmian words (Q2378539) (← links)
- Computing the \(\lambda \)-covers of a string (Q2384518) (← links)
- Generalized approximate regularities in strings (Q5451457) (← links)
- ALGORITHMS FOR APPROXIMATE K-COVERING OF STRINGS (Q5714671) (← links)
- Approximate periods of strings (Q5958136) (← links)