Constructing Infinite Words of Intermediate Arithmetical Complexity

DOI10.1007/978-3-642-00982-2_59zbMath1234.68333OpenAlexW1586473494MaRDI QIDQ3618624

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)

Related Items (1)

On possible growths of Toeplitz languages

Cites Work

• Sequences of linear arithmetical complexity
• Complexity of sequences and dynamical systems
• Arithmetical complexity of symmetric D0L words.
• Automatic Sequences
• Unnamed Item
• Unnamed Item

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