Curtin University Homepage
  • Library
  • Help
    • Admin

    espace - Curtin’s institutional repository

    JavaScript is disabled for your browser. Some features of this site may not work without it.
    View Item 
    • espace Home
    • espace
    • Curtin Research Publications
    • View Item
    • espace Home
    • espace
    • Curtin Research Publications
    • View Item

    The total run length of a word

    192486_192486.pdf (281.2Kb)
    Access Status
    Open access
    Authors
    Glen, A.
    Simpson, Jamie
    Date
    2013
    Type
    Journal Article
    
    Metadata
    Show full item record
    Citation
    Glen, Amy and Simpson, Jamie. 2013. The total run length of a word. Theoretical Computer Science. 501: pp. 41-48.
    Source Title
    Theoretical Computer Science
    DOI
    10.1016/j.tcs.2013.06.004
    ISSN
    03043975
    Remarks

    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

    URI
    http://hdl.handle.net/20.500.11937/42452
    Collection
    • Curtin Research Publications
    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.

    Related items

    Showing items related by title, author, creator and subject.

    • Transfer of prestress by pretensioned wire tendons
      Kong, Paul Y.L. (1993)
      Key words: End zone, prestress transfer, wire tendon, transmission length, pull-in, plain wire, indented wire, concrete strength, size of wire, gradual release, sudden release, shock release, time dependent effects.An ...
    • Extracting powers and periods in a word from its runs structure
      Crochemore, M.; Iliopoulos, Costas; Kubica, M.; Kubica, M.; Radoszewski, J.; Rytter, W.; Walen, T. (2014)
      A breakthrough in the field of text algorithms was the discovery of the fact that the maximal number of runs in a word of length n is O(n) and that they can all be computed in O(n) time. We study some applications of this ...
    • Palindromes in circular words
      Simpson, Jamie (2014)
      There is a very short and beautiful proof that the number of distinct non-empty palindromes in a word of length n is at most n. In this paper we show, with a very complicated proof, that the number of distinct non-empty ...
    Advanced search

    Browse

    Communities & CollectionsIssue DateAuthorTitleSubjectDocument TypeThis CollectionIssue DateAuthorTitleSubjectDocument Type

    My Account

    Admin

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    Follow Curtin

    • 
    • 
    • 
    • 
    • 

    CRICOS Provider Code: 00301JABN: 99 143 842 569TEQSA: PRV12158

    Copyright | Disclaimer | Privacy statement | Accessibility

    Curtin would like to pay respect to the Aboriginal and Torres Strait Islander members of our community by acknowledging the traditional owners of the land on which the Perth campus is located, the Whadjuk people of the Nyungar Nation; and on our Kalgoorlie campus, the Wongutha people of the North-Eastern Goldfields.