Constructing Infinite Words of Intermediate Arithmetical Complexity

DOI10.1007/978-3-642-00982-2_59MaRDI QIDQ3618624zbMATH OpenOpenAlexFDO

Authors Paul V. Salimov

Publication date 2 April 2009

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-00982-2_59

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• scientific article; zbMATH DE number 1948496
• On possible growths of arithmetical complexity
• A note on constructing infinite binary words with polynomial subword complexity
• A lower bound for the arithmetical complexity of Sturmian words
• Sequences of low arithmetical complexity

Cites work

• Arithmetical complexity of symmetric D0L words.
• Automatic Sequences
• Complexity of sequences and dynamical systems
• scientific article; zbMATH DE number 1948496 (Why is no real title available?)
• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• Sequences of linear arithmetical complexity

Cited in

(6)

• On possible growths of arithmetical complexity
• scientific article; zbMATH DE number 1948496 (Why is no real title available?)
• A note on constructing infinite binary words with polynomial subword complexity
• scientific article; zbMATH DE number 7559499 (Why is no real title available?)
• On possible growths of Toeplitz languages
• Sequences of linear arithmetical complexity

This page was built for publication: Constructing Infinite Words of Intermediate Arithmetical Complexity

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