scientific article; zbMATH DE number 3827234

MaRDI QIDQ3673134zbMATH OpenFDO

Authors Maxime Crochemore

Publication date 1983

zbMATH Keywords

linear searchingrandom access machinesquare in a word

Mathematics Subject Classification ID

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

Cited in

(19)

• Structural properties of the string statistics problem
• Optimal parallel detection of squares in strings
• String matching problems over free partially commutative monoids
• Finding approximate repetitions under Hamming distance.
• Linear time algorithms for finding and representing all the tandem repeats in a string
• Transducers and repetitions
• Palindromic Ziv-Lempel and Crochemore factorizations of m-bonacci infinite words
• The number of runs in a string
• Locating maximal approximate runs in a string
• 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
• Ziv-Lempel and Crochemore factorizations of the generalized period-doubling word
• On the palindromic zl-factorization and c-factorization of the generalized period-doubling sequences
• Efficient detection of quasiperiodicities in strings
• Linear-time computation of local periods
• On z-factorization and c-factorization of standard episturmian words
• Efficient on-line repetition detection

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3673134)