On the joint subword complexity of automatic sequences

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Power of words and recognizability of fixpoints of a substitution
Ensembles presque périodiques \(k\)-reconnaissables. (Almost periodic \(k\)-recognizable sets)
Suites algébriques, automates et substitutions
Automatic Sequences
Transcendence of formal power series with rational coefficients
Iteration of maps by an automaton
Substitution dynamical systems - spectral analysis
On the complexity of algebraic numbers. I: Expansions in integer bases
Pascal's triangle, complexity and automata
On the vector space of the automatic reals
Subword complexities of various classes of deterministic developmental languages without interactions
Complexité des facteurs des mots infinis engendrés par morphismes itérés
A Second Course in Formal Languages and Automata Theory
The 3x + 1 Problem and Its Generalizations
If a DOL language is k-power free then it is circular
Reconnaissabilité des substitutions et complexité des suites automatiques
On stabilizers of infinite words
On Subword Complexity of Morphic Sequences
Complexity of sequences and dynamical systems
Sequences of low complexity: Automatic and Sturmian sequences
Sums and rational multiples of \(q\)-automatic sequences are \(q\)-automatic
Linear cellular automata, finite automata and Pascal's triangle
Characterizing regular languages with polynomial densities
Asymptotic subword complexity of fixed points of group substitutions
On the Prime Factors of \binom2nn
On some arithmetical properties of middle binomial coefficients
On the joint distribution of \(q\)-additive functions in residue classes
Primitive substitutive numbers are closed under rational multiplication
On the distribution of \binom CnDn modulo p
Continued fractions, best measurements, and musical scales and intervals
On a problem of Granville and Zhu Regarding Pascal's triangle
Finite automata and morphisms in assisted musical composition*
Regularity of patterns in the factorization of n!

Cited In (6)

Minimum complexity of automatic non sturmian sequences
Autosubst: Reasoning with de Bruijn Terms and Parallel Substitutions
Automatic complexity of shift register sequences
Subword complexity and non-automaticity of certain completely multiplicative functions
Automata calculating the complexity of automatic sequences
The subword complexity of a two-parameter family of sequences

Recommendations

This page was built for publication: On the joint subword complexity of automatic sequences

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