Computing Primitively-Rooted Squares and Runs in Partial Words

DOI10.1007/978-3-319-19315-1_8zbMath1380.68319OpenAlexW943816513MaRDI QIDQ2946044

J. D. Quigley, Xufan Zhang, Jordan Nikkel, Francine Blanchet-Sadri

Publication date: 15 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-19315-1_8

Mathematics Subject Classification ID

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

Related Items (3)

Computing primitively-rooted squares and runs in partial words ⋮ Constructing Words with High Distinct Square Densities ⋮ Efficient enumeration of non-equivalent squares in partial words with few holes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Periodicity algorithms and a conjecture on overlaps in partial words
• Repetitions in strings: algorithms and combinatorics
• An optimal algorithm for computing the repetitions in a word
• Optimal off-line detection of repetitions in a string
• Squares 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
• Generalized String Matching
• A Graph Polynomial Approach to Primitivity
• On the number of squares in partial words
• Algorithms on Strings

This page was built for publication: Computing Primitively-Rooted Squares and Runs in Partial Words