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 nn. 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)τ(n) is the maximum TRL over all words of length nn. We show that n2/8<τ(n)<47n2/72+2nn^2/8 < τ(n) < 47n^2/72 + 2n for all nn. We also give a formula for the average total run length of words of length nn over an alphabet of size αα, and some other results.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.