The following pages link to (Q3673134):
Displaying 19 items.
- Efficient computation of maximal anti-exponent in palindrome-free strings (Q507406) (← links)
- Efficient detection of quasiperiodicities in strings (Q688155) (← links)
- Linear-time computation of local periods (Q703549) (← links)
- On z-factorization and c-factorization of standard episturmian words (Q719264) (← links)
- Efficient on-line repetition detection (Q955034) (← links)
- Structural properties of the string statistics problem (Q1076522) (← links)
- Optimal parallel detection of squares in strings (Q1194333) (← links)
- String matching problems over free partially commutative monoids (Q1207940) (← links)
- Finding approximate repetitions under Hamming distance. (Q1401359) (← links)
- Linear time algorithms for finding and representing all the tandem repeats in a string (Q1765295) (← links)
- Transducers and repetitions (Q1820587) (← links)
- Palindromic Ziv-Lempel and Crochemore factorizations of \(m\)-bonacci infinite words (Q2272382) (← links)
- The number of runs in a string (Q2381507) (← links)
- Locating maximal approximate runs in a string (Q2410363) (← links)
- Most pseudo-copy languages are not context-free (Q2695285) (← links)
- Un réseau linéaire pour la reconnaissance des mots sans carré (Q3789096) (← links)
- Greedy Palindromic Lengths (Q4640335) (← links)
- ZIV-LEMPEL AND CROCHEMORE FACTORIZATIONS OF THE GENERALIZED PERIOD-DOUBLING WORD (Q5075611) (← links)
- (Q5090541) (← links)
