On the joint subword complexity of automatic sequences
From MaRDI portal
Recommendations
- Reconnaissabilité des substitutions et complexité des suites automatiques
- On the \(N\)th linear complexity of automatic sequences
- Complexity of automatic sequences
- Complexity of automatic sequences
- On Subword Complexity of Morphic Sequences
- Subword complexity and non-automaticity of certain completely multiplicative functions
- The size of subsequence automaton
- Automatic complexity of shift register sequences
- The subword complexity of a two-parameter family of sequences
- scientific article; zbMATH DE number 1037960
Cites work
- scientific article; zbMATH DE number 1001512 (Why is no real title available?)
- scientific article; zbMATH DE number 3676007 (Why is no real title available?)
- scientific article; zbMATH DE number 3465382 (Why is no real title available?)
- scientific article; zbMATH DE number 1552120 (Why is no real title available?)
- scientific article; zbMATH DE number 3262459 (Why is no real title available?)
- A Second Course in Formal Languages and Automata Theory
- Asymptotic subword complexity of fixed points of group substitutions
- Automatic Sequences
- Characterizing regular languages with polynomial densities
- Complexity of sequences and dynamical systems
- Complexité des facteurs des mots infinis engendrés par morphismes itérés
- Continued fractions, best measurements, and musical scales and intervals
- Ensembles presque périodiques \(k\)-reconnaissables. (Almost periodic \(k\)-recognizable sets)
- Finite automata and morphisms in assisted musical composition*
- If a DOL language is k-power free then it is circular
- Iteration of maps by an automaton
- Linear cellular automata, finite automata and Pascal's triangle
- On Subword Complexity of Morphic Sequences
- On a problem of Granville and Zhu Regarding Pascal's triangle
- On some arithmetical properties of middle binomial coefficients
- On stabilizers of infinite words
- On the Prime Factors of \binom2nn
- On the complexity of algebraic numbers. I: Expansions in integer bases
- On the distribution of \binom CnDn modulo p
- On the joint distribution of \(q\)-additive functions in residue classes
- On the vector space of the automatic reals
- Pascal's triangle, complexity and automata
- Power of words and recognizability of fixpoints of a substitution
- Primitive substitutive numbers are closed under rational multiplication
- Reconnaissabilité des substitutions et complexité des suites automatiques
- Regularity of patterns in the factorization of n!
- Sequences of low complexity: Automatic and Sturmian sequences
- Substitution dynamical systems - spectral analysis
- Subword complexities of various classes of deterministic developmental languages without interactions
- Suites algébriques, automates et substitutions
- Sums and rational multiples of \(q\)-automatic sequences are \(q\)-automatic
- The 3x + 1 Problem and Its Generalizations
- Transcendence of formal power series with rational coefficients
Cited in
(9)- Mix-automatic sequences
- The subword complexity of a two-parameter family of sequences
- Autosubst: Reasoning with de Bruijn Terms and Parallel Substitutions
- Subword complexity and non-automaticity of certain completely multiplicative functions
- Automatic complexity of shift register sequences
- Automata calculating the complexity of automatic sequences
- Complexity of automatic sequences
- Minimum complexity of automatic non sturmian sequences
- Subword complexity and projection bodies
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)
