Computing the number of cubic runs in standard Sturmian words

DOI10.1016/J.DAM.2013.05.025MaRDI QIDQ496558zbMATH OpenOpenAlexFDO

Authors Marcin Piatkowski, 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

algorithmsrepetitionsSturmian wordscubic runsstandard words

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• The Number of Runs in Sturmian Words
• The maximal number of runs in standard Sturmian words
• The maximal number of cubic runs in a word
• Asymptotic behaviour of the maximal number of squares in standard Sturmian words
• Compressed string-matching in standard Sturmian words

Cites work

• scientific article; zbMATH DE number 5604082 (Why is no real title available?)
• scientific article; zbMATH DE number 5717191 (Why is no real title available?)
• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• scientific article; zbMATH DE number 2183071 (Why is no real title available?)
• scientific article; zbMATH DE number 1390079 (Why is no real title available?)
• A characterization of the squares in a Fibonacci string
• AN ASYMPTOTIC LOWER BOUND FOR THE MAXIMAL NUMBER OF RUNS IN A STRING
• Analysis of Maximal Repetitions in Strings
• Asymptotic behaviour of the maximal number of squares in standard Sturmian words
• Automatic Sequences
• Combinatorics on Words
• Compressed string-matching in standard Sturmian words
• Jewels of Stringology
• On the maximal number of cubic runs in a string
• Powers in Sturmian sequences
• Run-hierarchical structure of digital lines with irrational slopes in terms of continued fractions and the Gauss map
• Sturmian and Episturmian Words
• Substitutions in dynamics, arithmetics and combinatorics
• Suffix Automata and Standard Sturmian Words
• The Number of Runs in Sturmian Words
• The structure of subword graphs and suffix trees of Fibonacci words
• Towards a Solution to the “Runs” Conjecture
• Usefulness of directed acyclic subword graphs in problems related to standard Sturmian words

Cited in

(3)

• Asymptotic behaviour of the maximal number of squares in standard Sturmian words
• The Number of Runs in Sturmian Words
• The maximal number of runs in standard Sturmian words

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

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