Normal forms of quasiperiodic strings

DOI10.1016/S0304-3975(00)00065-7zbMATH Open0949.68089OpenAlexW2011221635MaRDI QIDQ1583537FDOQ1583537

Authors: L. 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

Recommendations

• Publication:4939600
• Frequency covers for strings
• Publication:4503964
• Quasiperiodicity and string covering
• Efficient detection of quasiperiodicities in strings

zbMATH Keywords

overlapregularitynormal formcoverquasiperiodicitySeed

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

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

Cited In (6)

• Minimal critical exponent of quasiperiodic words
• Title not available (Why is that?)
• Two strings at Hamming distance 1 cannot be both quasiperiodic
• Title not available (Why is that?)
• Speeding up the detection of evolutive tandem repeats
• Title not available (Why is that?)

This page was built for publication: Normal forms of quasiperiodic strings

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