Computing the number of cubic runs in standard Sturmian words
From MaRDI portal
Publication:496558
DOI10.1016/J.DAM.2013.05.025zbMATH Open1329.68202OpenAlexW2025012811MaRDI QIDQ496558FDOQ496558
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Automatic Sequences
- Combinatorics on Words
- Jewels of Stringology
- Title not available (Why is that?)
- Title not available (Why is that?)
- Substitutions in dynamics, arithmetics and combinatorics
- Sturmian and Episturmian Words
- Title not available (Why is that?)
- Title not available (Why is that?)
- Powers in Sturmian sequences
- The Number of Runs in Sturmian Words
- Usefulness of directed acyclic subword graphs in problems related to standard Sturmian words
- The structure of subword graphs and suffix trees of Fibonacci words
- A characterization of the squares in a Fibonacci string
- Towards a Solution to the “Runs” Conjecture
- AN ASYMPTOTIC LOWER BOUND FOR THE MAXIMAL NUMBER OF RUNS IN A STRING
- Analysis of Maximal Repetitions in Strings
- On the maximal number of cubic runs in a string
- Compressed string-matching in standard Sturmian words
- Asymptotic behaviour of the maximal number of squares in standard Sturmian words
- Suffix Automata and Standard Sturmian Words
- Run-hierarchical structure of digital lines with irrational slopes in terms of continued fractions and the Gauss map
Cited In (3)
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)
