AN ASYMPTOTIC LOWER BOUND FOR THE MAXIMAL NUMBER OF RUNS IN A STRING
From MaRDI portal
Publication:3532151
DOI10.1142/S0129054108005620zbMath1169.68563OpenAlexW2003022262MaRDI QIDQ3532151
Publication date: 3 November 2008
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054108005620
Related Items
Prefix frequency of lost positions, Lower bounds for the number of repetitions in 2D strings, Computing primitively-rooted squares and runs in partial words, On the structure of run-maximal strings, The “Runs” Theorem, Unnamed Item, On the average number of regularities in a word, On the maximal sum of exponents of runs in a string, How many runs can a string contain?, On the Maximal Sum of Exponents of Runsin a String, Computing the number of cubic runs in standard Sturmian words, Bannai et al. method proves the \(d\)-step conjecture for strings, The maximal number of cubic runs in a word, On primary and secondary repetitions in words, Repetitions in strings: algorithms and combinatorics, Three overlapping squares: the general case characterized \& applications
Cites Work
