Paper Info
Title
The total run length of a word
Abstract
A run in a word is a periodic factor whose length is at least twice its period and which cannot be extended to the left or right (by a letter) to a factor with greater period. In recent years a great deal of work has been done on estimating the maximum number of runs that can occur in a word of length n. A number of associated problems have also been investigated. In this paper we consider a new variation on the theme. We say that the total run length (TRL) of a word is the sum of the lengths of the runs in the word and that @t(n) is the maximum TRL over all words of length n. We show that n^2/8
Year
DOI
Venue
2013
10.1016/j.tcs.2013.06.004
Theoretical Computer Science
Keywords
DocType
Volume
great deal,length n,periodic factor,total run length,recent year,maximum number,greater period,maximum TRL,new variation,associated problem
Journal
501,
ISSN
Citations 
PageRank 
0304-3975
0
0.34
References 
Authors
14
2
Name
Order
Citations
PageRank
Amy Glen1123.03
Jamie Simpson216421.41