The Number of Runs in Sturmian Words

DOI10.1007/978-3-540-70844-5_26zbMATH Open1172.68565OpenAlexW1547429979MaRDI QIDQ3602820FDOQ3602820

Authors: Paweł Baturo, Marcin Piatkowski, 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

Recommendations

• The maximal number of runs in standard Sturmian words
• Computing the number of cubic runs in standard Sturmian words
• Asymptotic behaviour of the maximal number of squares in standard Sturmian words
• Usefulness of directed acyclic subword graphs in problems related to standard Sturmian words
• Compressed string-matching in standard Sturmian words

Mathematics Subject Classification ID

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

Cited In (12)

• The total run length of a word
• The maximal number of cubic runs in a word
• Compressed string-matching in standard Sturmian words
• Asymptotic behaviour of the maximal number of squares in standard Sturmian words
• Usefulness of directed acyclic subword graphs in problems related to standard Sturmian words
• Repetitions in strings: algorithms and combinatorics
• Repetitions in Sturmian strings
• A Series of Run-Rich Strings
• Computing the number of cubic runs in standard Sturmian words
• The maximal number of runs in standard Sturmian words
• On the maximum number of cubic subwords in a word
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3602820)