Computing primitively-rooted squares and runs in partial words

DOI10.1016/j.ejc.2017.07.020zbMath1380.68317OpenAlexW2749002969MaRDI QIDQ1678102

Peng Zhang

Publication date: 14 November 2017

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2017.07.020

Mathematics Subject Classification ID

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

Related Items (1)

Constructing Words with High Distinct Square Densities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Periodicity algorithms and a conjecture on overlaps in partial words
• The ``runs conjecture
• On primary and secondary repetitions in words
• Maximal repetitions in strings
• How many runs can a string contain?
• Repetitions in strings: algorithms and combinatorics
• Asymptotic behavior of the numbers of runs and microruns
• An optimal algorithm for computing the repetitions in a word
• Optimal off-line detection of repetitions in a string
• Squares and primitivity in partial words
• The number of runs in a string
• Squares in partial words
• Computing Primitively-Rooted Squares and Runs in Partial Words
• Periodicity Algorithms for Partial Words
• Combinatorial Queries and Updates on Partial Words
• An O(n log n) algorithm for finding all repetitions in a string
• AN ASYMPTOTIC LOWER BOUND FOR THE MAXIMAL NUMBER OF RUNS IN A STRING
• Not So Many Runs in Strings
• Generalized String Matching
• On the number of squares in partial words
• Algorithmic Combinatorics on Partial Words
• A new characterization of maximal repetitions by Lyndon trees
• Algorithms on Strings

This page was built for publication: Computing primitively-rooted squares and runs in partial words