Pages that link to "Item:Q2965496"
From MaRDI portal
The following pages link to Testing Generalised Freeness of Words (Q2965496):
Displaying 10 items.
- Disjunctivity and other properties of sets of pseudo-bordered words (Q530214) (← links)
- The extended equation of Lyndon and Schützenberger (Q730507) (← links)
- Tighter bounds and optimal algorithms for all maximal \(\alpha\)-gapped repeats and palindromes. Finding all maximal \(\alpha\)-gapped repeats and palindromes in optimal worst case time on integer alphabets (Q1702853) (← links)
- Hide and seek with repetitions (Q1713479) (← links)
- Formulas with reversal (Q2011639) (← links)
- Tight tradeoffs for real-time approximation of longest palindromes in streams (Q2319637) (← links)
- On Prefix/Suffix-Square Free Words (Q2949834) (← links)
- Interval Exchange Words and the Question of Hof, Knill, and Simon (Q3451117) (← links)
- Detecting One-Variable Patterns (Q5150937) (← links)
- Equations enforcing repetitions under permutations (Q5918930) (← links)
