A Series of Run-Rich Strings

DOI10.1007/978-3-642-00982-2_49zbMath1234.68332OpenAlexW1841567773MaRDI QIDQ3618614

Hideo Bannai, Ayumi Shinohara, Wataru Matsubara, Kazuhiko Kusano

Publication date: 2 April 2009

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-00982-2_49

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items

Prefix frequency of lost positions, The total run length of a word, On the average number of regularities in a word, Average number of occurrences of repetitions in a necklace, Bannai et al. method proves the \(d\)-step conjecture for strings

Cites Work

• Unnamed Item
• Maximal repetitions in strings
• How many runs can a string contain?
• The number of runs in a string
• Towards a Solution to the “Runs” Conjecture
• Not So Many Runs in Strings
• The Number of Runs in Sturmian Words
• The Number of Runs in a String: Improved Analysis of the Linear Upper Bound