On the arithmetical complexity of Sturmian words
From MaRDI portal
Publication:2373754
DOI10.1016/J.TCS.2007.03.022zbMATH Open1119.68138OpenAlexW2021349402MaRDI QIDQ2373754FDOQ2373754
Authors: Julien Cassaigne, Anna Frid 
Publication date: 16 July 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.03.022
Recommendations
Cites Work
- Sequences with subword complexity \(2n\)
- Sequence entropy and the maximal pattern complexity of infinite words
- A remark on morphic sturmian words
- Complexity of sequences and dynamical systems
- A GEOMETRIC PROOF OF THE ENUMERATION FORMULA FOR STURMIAN WORDS
- Arithmetical complexity of symmetric D0L words.
- On possible growths of arithmetical complexity
- Sequences of linear arithmetical complexity
- Sequences of low arithmetical complexity
- Title not available (Why is that?)
- *-Sturmian words and complexity
- A lower bound for the arithmetical complexity of Sturmian words
Cited In (13)
- Title not available (Why is that?)
- Computing the \(k\)-binomial complexity of the Thue-Morse word
- Arithmetical complexity of symmetric D0L words.
- *-Sturmian words and complexity
- A lower bound for the arithmetical complexity of Sturmian words
- Asymptotic formula for balanced words
- On possible growths of arithmetical complexity
- On the complexity functions of Sturmian words
- On the structure of bispecial Sturmian words
- Sequences of low arithmetical complexity
- Monochromatic arithmetic progressions in binary Thue-Morse-like words
- On the Lie complexity of Sturmian words
- Sturmian and Episturmian Words
This page was built for publication: On the arithmetical complexity of Sturmian words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2373754)
