Bounds on Powers in Strings

DOI10.1007/978-3-540-85780-8_16MaRDI QIDQ3533012zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• NUMBER OF OCCURRENCES OF POWERS IN STRINGS
• String powers in trees
• String Powers in Trees
• How many runs can a string contain?
• Maximal repetitions in strings

Cites work

• scientific article; zbMATH DE number 2183071 (Why is no real title available?)
• A characterization of the squares in a Fibonacci string
• An O(n log n) algorithm for finding all repetitions in a string
• An optimal algorithm for computing the repetitions in a word
• Analysis of Maximal Repetitions in Strings
• Detecting leftmost maximal periodicities
• How many runs can a string contain?
• Not So Many Runs in Strings
• Optimal off-line detection of repetitions in a string
• Squares, cubes, and time-space efficient string searching
• The Number of Runs in a String: Improved Analysis of the Linear Upper Bound
• The number of runs in a string

Cited in

(8)

• String Powers in Trees
• New simple efficient algorithms computing powers and runs in strings
• String powers in trees
• On the average number of regularities in a word
• Repetitions in strings: algorithms and combinatorics
• A note on the maximum number of \(k\)-powers in a finite word
• NUMBER OF OCCURRENCES OF POWERS IN STRINGS
• On string replacement exponentiation

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

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