Bounds on Powers in Strings

DOI10.1007/978-3-540-85780-8_16zbMath1159.68014OpenAlexW1706995980MaRDI QIDQ3533012

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

Publication date: 30 October 2008

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85780-8_16

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

On the average number of regularities in a word ⋮ New simple efficient algorithms computing powers and runs in strings ⋮ Repetitions in strings: algorithms and combinatorics

Cites Work

• Unnamed Item
• How many runs can a string contain?
• 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
• Analysis of Maximal Repetitions in Strings
• Not So Many Runs in Strings
• The Number of Runs in a String: Improved Analysis of the Linear Upper Bound

This page was built for publication: Bounds on Powers in Strings