The total run length of a word
| dc.contributor.author | Glen, A. | |
| dc.contributor.author | Simpson, Jamie | |
| dc.date.accessioned | 2017-01-30T14:59:48Z | |
| dc.date.available | 2017-01-30T14:59:48Z | |
| dc.date.created | 2013-09-05T20:00:25Z | |
| dc.date.issued | 2013 | |
| dc.identifier.citation | Glen, Amy and Simpson, Jamie. 2013. The total run length of a word. Theoretical Computer Science. 501: pp. 41-48. | |
| dc.identifier.uri | http://hdl.handle.net/20.500.11937/42452 | |
| dc.identifier.doi | 10.1016/j.tcs.2013.06.004 | |
| dc.description.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 τ(n) is the maximum TRL over all words of length n. We show that n2/8<τ(n)<47n2/72+2nn2/8<τ(n)<47n2/72+2n for all n. We also give a formula for the average total run length of words of length n over an alphabet of size α, and some other results. | |
| dc.publisher | Elsevier | |
| dc.title | The total run length of a word | |
| dc.type | Journal Article | |
| dcterms.source.volume | 501 | |
| dcterms.source.startPage | 41 | |
| dcterms.source.endPage | 48 | |
| dcterms.source.issn | 03043975 | |
| dcterms.source.title | Theoretical Computer Science | |
| curtin.note |
NOTICE: this is the author’s version of a work that was accepted for publication in Theoretical Computer Science. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Theoretical Computer Science, Vol. 501(2013). DOI: 10.1016/j.tcs.2013.06.004 | |
| curtin.department | ||
| curtin.accessStatus | Open access |