Normal forms of quasiperiodic strings

DOI10.1016/S0304-3975(00)00065-7zbMath0949.68089OpenAlexW2011221635MaRDI QIDQ1583537

Laurent Mouchard

Publication date: 26 October 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00065-7

zbMATH Keywords

overlapregularitynormal formquasiperiodicitycoverSeed

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Speeding up the detection of evolutive tandem repeats, Minimal critical exponent of quasiperiodic words

Cites Work

• Efficient detection of quasiperiodicities in strings
• Optimal superprimitivity testing for strings
• The smallest automaton recognizing the subwords of a text
• Optimal off-line detection of repetitions in a string
• An on-line string superprimitivity test
• Testing string superprimitivity in parallel
• An optimal algorithm to compute all the covers of a string
• Fast Pattern Matching in Strings
• COVERING A CIRCULAR STRING WITH SUBSTRINGS OF FIXED LENGTH
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item