On a lemma of Crochemore and Rytter

DOI10.1016/j.jda.2015.05.006zbMath1336.68207OpenAlexW982892443WikidataQ124828546 ScholiaQ124828546MaRDI QIDQ491147

Frantisek Franek, Antoine Deza, Haoyue Bai

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

squarefactorizationstringprimitive stringdouble square

Mathematics Subject Classification ID

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

Cites Work

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

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