Testing generalised freeness of words

DOI10.4230/LIPICS.STACS.2014.337MaRDI QIDQ2965496zbMATH OpenOpenAlexFDO

Authors Paweł Gawrychowski, Florin Manea, Dirk Nowotka

Publication date 3 March 2017

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2014/4469/pdf/27.pdf

zbMATH Keywords

pattern matchingpseudo-repetitionrepetitionstringology

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Recommendations

• Discovering hidden repetitions in words
• Hide and seek with repetitions
• Finding pseudo-repetitions
• Fine and Wilf's theorem and pseudo-repetitions
• On matching generalised repetitive patterns

Cited in

(15)

• Tighter bounds and optimal algorithms for all maximal -gapped repeats and palindromes. Finding all maximal -gapped repeats and palindromes in optimal worst case time on integer alphabets
• Hide and seek with repetitions
• Formulas with reversal
• Tight tradeoffs for real-time approximation of longest palindromes in streams
• Fine and Wilf's theorem and pseudo-repetitions
• On prefix/suffix-square free words
• Finding pseudo-repetitions
• Interval exchange words and the question of Hof, Knill, and Simon
• Detecting one-variable patterns
• Disjunctivity and other properties of sets of pseudo-bordered words
• Discovering hidden repetitions in words
• Equations enforcing repetitions under permutations
• Equations enforcing repetitions under permutations
• Watson-Crick conjugates of words and languages
• The extended equation of Lyndon and Schützenberger

This page was built for publication: Testing generalised freeness of words

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