Average value of sum of exponents of runs in a string

DOI10.1142/S0129054109007078MaRDI QIDQ3655541zbMATH OpenFDO

Authors Kazuhiko Kusano, Wataru Matsubara, Akira Ishino, Ayumi Shinohara

Publication date 8 January 2010

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054109007078

zbMATH Keywords

combinatorics on wordsrepetitionrun

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• On the Maximal Sum of Exponents of Runsin a String
• On the maximal sum of exponents of runs in a string
• How many runs can a string contain?
• Not So Many Runs in Strings
• Asymptotic behavior of the numbers of runs and microruns

Cites work

• An optimal algorithm for computing the repetitions in a word
• How many runs can a string contain?
• The number of runs in a string

Cited in

(3)

• On the average number of regularities in a word
• The total run length of a word
• Average number of occurrences of repetitions in a necklace

This page was built for publication: Average value of sum of exponents of runs in a string

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3655541)