scientific article

zbMath0522.68074MaRDI QIDQ3673134

Maxime Crochemore

Publication date: 1983

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

random access machinesquare in a wordlinear searching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items

Structural properties of the string statistics problem, The number of runs in a string, ZIV-LEMPEL AND CROCHEMORE FACTORIZATIONS OF THE GENERALIZED PERIOD-DOUBLING WORD, Locating maximal approximate runs in a string, Finding approximate repetitions under Hamming distance., Most pseudo-copy languages are not context-free, Un réseau linéaire pour la reconnaissance des mots sans carré, Greedy Palindromic Lengths, Efficient computation of maximal anti-exponent in palindrome-free strings, Optimal parallel detection of squares in strings, Efficient on-line repetition detection, Efficient detection of quasiperiodicities in strings, String matching problems over free partially commutative monoids, Linear time algorithms for finding and representing all the tandem repeats in a string, Linear-time computation of local periods, Palindromic Ziv-Lempel and Crochemore factorizations of \(m\)-bonacci infinite words, On z-factorization and c-factorization of standard episturmian words, Unnamed Item, Transducers and repetitions