On the joint subword complexity of automatic sequences
From MaRDI portal
Publication:837149
DOI10.1016/j.tcs.2009.03.041zbMath1172.68036OpenAlexW2042085055MaRDI QIDQ837149
Publication date: 10 September 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.03.041
automatic sequencessubword complexity\(q\)-additive sequencesmorphic real numbersprimitive substitutions
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the vector space of the automatic reals
- Regularity of patterns in the factorization of n!
- On stabilizers of infinite words
- Asymptotic subword complexity of fixed points of group substitutions
- Substitution dynamical systems - spectral analysis
- Power of words and recognizability of fixpoints of a substitution
- Sums and rational multiples of \(q\)-automatic sequences are \(q\)-automatic
- Subword complexities of various classes of deterministic developmental languages without interactions
- Ensembles presque périodiques \(k\)-reconnaissables. (Almost periodic \(k\)-recognizable sets)
- Pascal's triangle, complexity and automata
- On the joint distribution of \(q\)-additive functions in residue classes
- Transcendence of formal power series with rational coefficients
- Primitive substitutive numbers are closed under rational multiplication
- Complexity of sequences and dynamical systems
- Iteration of maps by an automaton
- Linear cellular automata, finite automata and Pascal's triangle
- On the complexity of algebraic numbers. I: Expansions in integer bases
- Complexité des facteurs des mots infinis engendrés par morphismes itérés
- On the distribution of \binom CnDn modulo p
- On Subword Complexity of Morphic Sequences
- Continued fractions, best measurements, and musical scales and intervals
- A Second Course in Formal Languages and Automata Theory
- The 3x + 1 Problem and Its Generalizations
- Suites algébriques, automates et substitutions
- On the Prime Factors of \binom2nn
- On some arithmetical properties of middle binomial coefficients
- Automatic Sequences
- If a DOL language is k-power free then it is circular
- Reconnaissabilité des substitutions et complexité des suites automatiques
- Characterizing regular languages with polynomial densities
- On a problem of Granville and Zhu Regarding Pascal's triangle
- Finite automata and morphisms in assisted musical composition*
This page was built for publication: On the joint subword complexity of automatic sequences
