On the maximal number of cubic runs in a string

DOI10.1007/978-3-642-13089-2_19zbMATH Open1284.68484DBLPconf/lata/CrochemoreIKRRW10OpenAlexW1496549841WikidataQ61677905 ScholiaQ61677905MaRDI QIDQ3564863FDOQ3564863

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

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

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cited In (14)

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

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)