On the Maximal Number of Cubic Subwords in a String

DOI10.1007/978-3-642-10217-2_34zbMath1267.68171arXiv0911.1370OpenAlexW1755266696MaRDI QIDQ3651561

Marcin Kubica, Jakub Radoszewski, Tomasz Walen, Wojciech Rytter

Publication date: 11 December 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0911.1370

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items

Extracting powers and periods in a word from its runs structure, On the number of \(k\)-powers in a finite word, On the average number of regularities in a word, The maximal number of cubic runs in a word, On the maximum number of cubic subwords in a word