On the maximal number of cubic runs in a string

DOI10.1007/978-3-642-13089-2_19MaRDI QIDQ3564863zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń

Publication date 26 May 2010

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13089-2_19

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• The maximal number of cubic runs in a word
• How many runs can a string contain?
• The number of runs in a string
• The Number of Runs in a String: Improved Analysis of the Linear Upper Bound
• The runs theorem and beyond

Cited in

(14)

• The maximal number of cubic runs in a word
• On the maximum number of cubic subwords in a word
• On the average number of regularities in a word
• On the Maximal Sum of Exponents of Runsin a String
• scientific article; zbMATH DE number 5717191 (Why is no real title available?)
• On the maximal number of cubic subwords in a string
• On the structure of run-maximal strings
• On the maximal sum of exponents of runs in a string
• The number of q-ary words with restrictions on the length of the maximal run
• New simple efficient algorithms computing powers and runs in strings
• Average number of occurrences of repetitions in a necklace
• Computing the number of cubic runs in standard Sturmian words
• The Number of Runs in a String: Improved Analysis of the Linear Upper Bound
• On primary and secondary repetitions in words

This page was built for publication: On the maximal number of cubic runs in a string

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