NUMBER OF OCCURRENCES OF POWERS IN STRINGS

DOI10.1142/S0129054110007416MaRDI QIDQ3586403zbMATHOpenAlexWikidataFDO

Authors Maxime Crochemore, Szilárd Zsolt Fazekas, 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)

Recommendations

• Bounds on Powers in Strings
• Strings of first digits of powers of a number
• String powers in trees
• String Powers in Trees
• Algorithms for anti-powers in strings
• Counting certain binary strings
• Final digit strings of powers
• On the Maximal Sum of Exponents of Runsin a String
• On the maximal sum of exponents of runs in a string
• Maximal repetitions in strings

Cites work

• 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
• Detecting leftmost maximal periodicities
• Optimal off-line detection of repetitions in a string
• Squares, cubes, and time-space efficient string searching
• The number of runs in a string

Cited in

(7)

• String Powers in Trees
• On the average number of regularities in a word
• Clusters of repetition roots: single chains
• Bounds on Powers in Strings
• A note on the maximum number of \(k\)-powers in a finite word
• Clusters of repetition roots forming prefix chains
• On string replacement exponentiation

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

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