How many runs can a string contain?
Authors:
- Simon J. PuglisiSPSimon J. Puglisi
- Jamie SimpsonJSJamie Simpson
- W.F. SmythWSW.F. Smyth
- 1 July 2008
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 401 (1-3) , 165-171
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Maximal repetitions in stringsJournal of Computer and System Sciences, 2008
- The number of runs in a stringInformation and Computation, 2007
- Intersecting periodic wordsTheoretical Computer Science, 2006
- A New Periodicity LemmaSIAM Journal on Discrete Mathematics, 2006
- Algebraic Combinatorics on Words2002
- Fine and Wilf's theorem for three periods and a generalization of Sturmian wordsTheoretical Computer Science, 1999
- Detecting leftmost maximal periodicitiesDiscrete Applied Mathematics, 1989
- An optimal algorithm for computing the repetitions in a wordInformation Processing Letters, 1981
- Uniqueness theorems for periodic functionsProceedings of the American Mathematical Society, 1965