Sequences of low arithmetical complexity
From MaRDI portal
Recommendations
Cites work
- *-Sturmian words and complexity
- A lower bound for the arithmetical complexity of Sturmian words
- A remark on morphic sturmian words
- Arithmetical complexity of symmetric D0L words.
- Complexity and special factors
- Complexity of sequences and dynamical systems
- Complexity of Toeplitz sequences
- Decimations and sturmian words
- scientific article; zbMATH DE number 3151690 (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
- On possible growths of arithmetical complexity
- On sets of integers containing k elements in arithmetic progression
- On the arithmetical complexity of Sturmian words
- Palindrome complexity.
- Sequences of linear arithmetical complexity
- The number of factors in a paperfolding sequence
- Toeplitz words, generalized periodicity and periodically iterated morphisms
Cited in
(19)- Monochromatic arithmetic progressions in binary Thue-Morse-like words
- Formulas for complexity, invariant measure and RQA characteristics of the period-doubling subshift
- Arithmetic operations on short finite sequences
- On the arithmetical complexity of Sturmian words
- A lower bound for the arithmetical complexity of Sturmian words
- On maximal pattern complexity of some automatic words
- On possible growths of arithmetical complexity
- Sturmian and Episturmian Words
- Constructing Infinite Words of Intermediate Arithmetical Complexity
- scientific article; zbMATH DE number 2051150 (Why is no real title available?)
- scientific article; zbMATH DE number 1506516 (Why is no real title available?)
- Recurrence quantification analysis of the period-doubling sequence
- Sequences of linear arithmetical complexity
- Non-injectivity of infinite interval exchange transformations and generalized Thue-Morse sequences
- Monochromatic arithmetic progressions in automatic sequences with group structure
- Word of low complexity without uniform frequencies
- On the complexity functions of Sturmian words
- On monochromatic arithmetic progressions in binary words associated with pattern sequences
- Complexity of infinite words
This page was built for publication: Sequences of low arithmetical complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3423138)
