The total run length of a word
Authors:
- Amy GlenAGAmy Glen
- Jamie SimpsonJSJamie Simpson
- 1 August 2013
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 501, 41-48
Abstract
No abstract availableAll Related Versions
This publication has 6 references indexed in Scilit:
- On the maximal sum of exponents of runs in a stringJournal of Discrete Algorithms, 2012
- The “runs” conjectureTheoretical Computer Science, 2011
- AVERAGE VALUE OF SUM OF EXPONENTS OF RUNS IN A STRINGInternational Journal of Foundations of Computer Science, 2009
- Maximal repetitions in stringsJournal of Computer and System Sciences, 2008
- How many runs can a string contain?Theoretical Computer Science, 2008
- Uniqueness theorems for periodic functionsProceedings of the American Mathematical Society, 1965