On the density of Lyndon roots in factors

DOI10.1016/j.tcs.2016.02.015zbMath1356.68165OpenAlexW2273802881WikidataQ61677832 ScholiaQ61677832MaRDI QIDQ507403

Robert Mercaş, Maxime Crochemore

Publication date: 6 February 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.02.015

zbMATH Keywords

Lyndon wordsrunscritical factorisationLyndon roots

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (2)

Unnamed Item ⋮ Some results on the number of periodic factors in words

Cites Work

• Unnamed Item
• A \(d\)-step approach to the maximum number of distinct squares and runs in strings
• The ``runs conjecture
• Maximal repetitions in strings
• How many runs can a string contain?
• A characterization of the squares in a Fibonacci string
• The maximal number of cubic runs in a word
• The number of runs in a string
• Two-way string-matching
• A new characterization of maximal repetitions by Lyndon trees
• The Number of Runs in a String: Improved Analysis of the Linear Upper Bound

This page was built for publication: On the density of Lyndon roots in factors