The total run length of a word

DOI10.1016/j.tcs.2013.06.004zbMath1296.68117arXiv1301.6568OpenAlexW1973978298MaRDI QIDQ391314

Amy Glen, R. Jamie Simpson

Publication date: 10 January 2014

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

Full work available at URL: https://arxiv.org/abs/1301.6568

zbMATH Keywords

wordsstringsrunsmaximum number of runstotal run length

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the maximal sum of exponents of runs in a string
• The ``runs conjecture
• Maximal repetitions in strings
• How many runs can a string contain?
• Not So Many Runs in Strings
• The Number of Runs in Sturmian Words
• A Series of Run-Rich Strings
• AVERAGE VALUE OF SUM OF EXPONENTS OF RUNS IN A STRING
• Uniqueness Theorems for Periodic Functions
• The Number of Runs in a String: Improved Analysis of the Linear Upper Bound

This page was built for publication: The total run length of a word