NUMBER OF OCCURRENCES OF POWERS IN STRINGS

DOI10.1142/S0129054110007416zbMath1209.68397OpenAlexW2125710436WikidataQ61677904 ScholiaQ61677904MaRDI QIDQ3586403

Szilárd Zsolt Fazekas, Maxime Crochemore, Costas S. Iliopoulos, Inuka Jayasekera

Publication date: 6 September 2010

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054110007416

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (3)

Clusters of repetition roots: single chains ⋮ On the average number of regularities in a word ⋮ Clusters of repetition roots forming prefix chains

Cites Work

• An optimal algorithm for computing the repetitions in a word
• Optimal off-line detection of repetitions in a string
• A characterization of the squares in a Fibonacci string
• Detecting leftmost maximal periodicities
• Squares, cubes, and time-space efficient string searching
• The number of runs in a string
• An O(n log n) algorithm for finding all repetitions in a string

This page was built for publication: NUMBER OF OCCURRENCES OF POWERS IN STRINGS