On possible growths of arithmetical complexity

DOI10.1051/ITA:2006021MaRDI QIDQ3421906zbMATH OpenOpenAlexFDO

Authors Anna Frid

Publication date 8 February 2007

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL http://www.numdam.org/item?id=ITA_2006__40_3_443_0, https://eudml.org/doc/92812, https://semanticscholar.org/paper/3a9efefaecebe81d5212984125fef270985792ac

zbMATH Keywords

arithmetical complexitybispecial wordsinfinite wordsubword complexityToeplitz word

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics on words (68R15)

Recommendations

• Constructing Infinite Words of Intermediate Arithmetical Complexity
• On possible growths of Toeplitz languages
• Sequences of linear arithmetical complexity
• scientific article; zbMATH DE number 2051150
• scientific article; zbMATH DE number 1948496

Cites work

• *-Sturmian words and complexity
• A lower bound for the arithmetical complexity of Sturmian words
• Arithmetical complexity of symmetric D0L words.
• Automatic Sequences
• Canonical positions for the factors in paperfolding sequences
• Complexity and special factors
• Complexity of sequences and dynamical systems
• Complexity of Toeplitz sequences
• scientific article; zbMATH DE number 4085051 (Why is no real title available?)
• scientific article; zbMATH DE number 1948496 (Why is no real title available?)
• scientific article; zbMATH DE number 2087492 (Why is no real title available?)
• Local symmetries in the period-doubling sequence
• Maximal pattern complexity for discrete systems
• Maximal pattern complexity of words over \(\ell\) letters
• Modified complexity and *-Sturmian word
• On the arithmetical complexity of Sturmian words
• Palindrome complexity.
• Sequence entropy and the maximal pattern complexity of infinite words
• Sequences of linear arithmetical complexity
• Sequences of low arithmetical complexity
• Toeplitz words, generalized periodicity and periodically iterated morphisms
• Two dimensional word with \(2k\) maximal pattern complexity

Cited in

(10)

• On arithmetic index in the generalized Thue-Morse word
• On the arithmetical complexity of Sturmian words
• Words with minimal growth function
• Arithmetical closure of two-dimensional Toeplitz words
• Sequences of low arithmetical complexity
• Constructing Infinite Words of Intermediate Arithmetical Complexity
• scientific article; zbMATH DE number 1948496 (Why is no real title available?)
• scientific article; zbMATH DE number 2051150 (Why is no real title available?)
• On possible growths of Toeplitz languages
• Sequences of linear arithmetical complexity

This page was built for publication: On possible growths of arithmetical complexity

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