The Number of Runs in Sturmian Words

DOI10.1007/978-3-540-70844-5_26zbMath1172.68565OpenAlexW1547429979MaRDI QIDQ3602820

Marcin Piątkowski, Paweł Baturo, Wojciech Rytter

Publication date: 12 February 2009

Published in: Implementation and Applications of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70844-5_26

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (7)

The total run length of a word ⋮ Computing the number of cubic runs in standard Sturmian words ⋮ The maximal number of cubic runs in a word ⋮ On the maximum number of cubic subwords in a word ⋮ Compressed string-matching in standard Sturmian words ⋮ A Series of Run-Rich Strings ⋮ Repetitions in strings: algorithms and combinatorics

This page was built for publication: The Number of Runs in Sturmian Words