On the arithmetical complexity of Sturmian words

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

zbMATH Keywords

Fibonacci wordSturmian wordsubword complexityinfinite wordarithmetical complexityrotation word

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• A lower bound for the arithmetical complexity of Sturmian words
• On the Lie complexity of Sturmian words
• A new complexity function, repetitions in Sturmian words, and irrationality exponents of Sturmian numbers
• On the character of words of sublinear complexity
• Periodic and Sturmian languages

Cites work

• scientific article; zbMATH DE number 2087492 (Why is no real title available?)
• *-Sturmian words and complexity
• A GEOMETRIC PROOF OF THE ENUMERATION FORMULA FOR STURMIAN WORDS
• A lower bound for the arithmetical complexity of Sturmian words
• A remark on morphic sturmian words
• Arithmetical complexity of symmetric D0L words.
• Complexity of sequences and dynamical systems
• On possible growths of arithmetical complexity
• Sequence entropy and the maximal pattern complexity of infinite words
• Sequences of linear arithmetical complexity
• Sequences of low arithmetical complexity
• Sequences with subword complexity \(2n\)

Cited in

(16)

• *-Sturmian words and complexity
• On the structure of bispecial Sturmian words
• On possible growths of arithmetical complexity
• Sequences of low arithmetical complexity
• Asymptotic formula for balanced words
• On the complexity functions of Sturmian words
• Monochromatic arithmetic progressions in binary Thue-Morse-like words
• On the Lie complexity of Sturmian words
• A lower bound for the arithmetical complexity of Sturmian words
• On the parity slope of words of low complexity
• Decidability for Sturmian words
• Computing the \(k\)-binomial complexity of the Thue-Morse word
• Arithmetical complexity of symmetric D0L words.
• Sturmian and Episturmian Words
• A new complexity function, repetitions in Sturmian words, and irrationality exponents of Sturmian numbers
• scientific article; zbMATH DE number 2162180 (Why is no real title available?)

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)