On a lemma of Crochemore and Rytter

DOI10.1016/J.JDA.2015.05.006MaRDI QIDQ491147zbMATH OpenOpenAlexWikidataFDO

Authors H. Bai, Antoine Deza, Frantisek Franek

Publication date 24 August 2015

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jda.2015.05.006

zbMATH Keywords

double squarefactorizationprimitive stringsquarestring

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Recommendations

• The three squares lemma revisited
• Lyndon Words, the Three Squares Lemma, and Primitive Squares
• Combinatorial Pattern Matching
• A New Periodicity Lemma
• Three overlapping squares: the general case characterized \& applications

Cites work

• A New Periodicity Lemma
• A simple proof that a word of length \(n\) has at most \(2n\) distinct squares
• Algorithms on Strings
• How many double squares can a string contain?
• How many squares can a string contain?
• Intersecting periodic words
• Simple and flexible detection of contiguous repeats using a suffix tree
• Squares, cubes, and time-space efficient string searching
• Uniqueness Theorems for Periodic Functions

Cited in

(4)

• The new periodicity lemma revisited
• The three squares lemma revisited
• scientific article; zbMATH DE number 1843999 (Why is no real title available?)
• Lyndon Words, the Three Squares Lemma, and Primitive Squares

This page was built for publication: On a lemma of Crochemore and Rytter

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