On possible growths of Toeplitz languages

DOI10.1134/S0037446606010071zbMath1215.68191arXiv1003.1489OpenAlexW2112509991MaRDI QIDQ536628

Julien Cassaigne, Fedor Petrov, Anna E. Frid

Publication date: 19 May 2011

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1003.1489

zbMATH Keywords

Tauberian theoremssubword complexityarithmetical complexitycombinatorics on wordsasymptotic combinatoricsToeplitz wordsanalytical methods in combinatoricsWiener-Pitt theorem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15) Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sequences of linear arithmetical complexity
• Complexity and special factors
• Complexity of sequences and dynamical systems
• Toeplitz words, generalized periodicity and periodically iterated morphisms
• Complexity of Toeplitz sequences
• Arithmetical complexity of symmetric D0L words.
• On possible growths of arithmetical complexity
• Constructing Infinite Words of Intermediate Arithmetical Complexity
• On the Linear Independence of Fractional Powers of Integers

This page was built for publication: On possible growths of Toeplitz languages