On the Maximal Number of Cubic Runs in a String

DOI10.1007/978-3-642-13089-2_19zbMath1284.68484OpenAlexW1496549841WikidataQ61677905 ScholiaQ61677905MaRDI QIDQ3564863

Costas S. Iliopoulos, Maxime Crochemore, Marcin Kubica, Tomasz Walen, Jakub Radoszewski, Wojciech Rytter

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)

Related Items

On the average number of regularities in a word, On the maximal sum of exponents of runs in a string, On the Maximal Sum of Exponents of Runsin a String, New simple efficient algorithms computing powers and runs in strings, Computing the number of cubic runs in standard Sturmian words, The maximal number of cubic runs in a word, On primary and secondary repetitions in words