On the density of Lyndon roots in factors

DOI10.1016/J.TCS.2016.02.015MaRDI QIDQ507403zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Recommendations

• The ``runs theorem
• The runs theorem and beyond
• Towards a Solution to the “Runs” Conjecture
• The ``runs conjecture
• The number of runs in a string

Cites work

• scientific article; zbMATH DE number 1024080 (Why is no real title available?)
• A \(d\)-step approach to the maximum number of distinct squares and runs in strings
• A characterization of the squares in a Fibonacci string
• A new characterization of maximal repetitions by Lyndon trees
• How many runs can a string contain?
• Maximal repetitions in strings
• The Number of Runs in a String: Improved Analysis of the Linear Upper Bound
• The ``runs conjecture
• The maximal number of cubic runs in a word
• The number of runs in a string
• Two-way string-matching

Cited in

(4)

• scientific article; zbMATH DE number 6862137 (Why is no real title available?)
• scientific article; zbMATH DE number 7651171 (Why is no real title available?)
• Some results on the number of periodic factors in words
• Density of Critical Factorizations

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

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