Computing the number of cubic runs in standard Sturmian words

DOI10.1016/j.dam.2013.05.025zbMath1329.68202OpenAlexW2025012811MaRDI QIDQ496558

Marcin Piątkowski, Wojciech Rytter

Publication date: 22 September 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.05.025

zbMATH Keywords

algorithmsSturmian wordsrepetitionscubic runsstandard words

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Substitutions in dynamics, arithmetics and combinatorics
• Run-hierarchical structure of digital lines with irrational slopes in terms of continued fractions and the Gauss map
• The structure of subword graphs and suffix trees of Fibonacci words
• A characterization of the squares in a Fibonacci string
• Powers in Sturmian sequences
• Compressed string-matching in standard Sturmian words
• ASYMPTOTIC BEHAVIOUR OF THE MAXIMAL NUMBER OF SQUARES IN STANDARD STURMIAN WORDS
• Towards a Solution to the “Runs” Conjecture
• Sturmian and Episturmian Words
• Analysis of Maximal Repetitions in Strings
• AN ASYMPTOTIC LOWER BOUND FOR THE MAXIMAL NUMBER OF RUNS IN A STRING
• Combinatorics on Words
• On the Maximal Number of Cubic Runs in a String
• The Number of Runs in Sturmian Words
• USEFULNESS OF DIRECTED ACYCLIC SUBWORD GRAPHS IN PROBLEMS RELATED TO STANDARD STURMIAN WORDS
• Automatic Sequences
• Jewels of Stringology
• Suffix Automata and Standard Sturmian Words

This page was built for publication: Computing the number of cubic runs in standard Sturmian words