On the joint subword complexity of automatic sequences
type: Item
instance of: scholarly article
title: On the joint subword complexity of automatic sequences
zbMATH Open document ID: 1172.68036
author: Yossi Moshe
published in: Theoretical Computer Science
publication date: 2009-09-10T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5602720
zbMATH Keywords: subword complexity
zbMATH Keywords: \(q\)-additive sequences
zbMATH Keywords: automatic sequences
zbMATH Keywords: morphic real numbers
zbMATH Keywords: primitive substitutions
MaRDI profile type: Publication
full work available at URL: j.tcs.2009.03.041
OpenAlex ID: W2042085055
cites work: On the complexity of algebraic numbers. I: Expansions in integer bases
cites work: Transcendence of formal power series with rational coefficients
cites work: Pascal's triangle, complexity and automata
cites work: Linear cellular automata, finite automata and Pascal's triangle
cites work: Finite automata and morphisms in assisted musical composition*
cites work: Q3128793
cites work: Automatic Sequences
cites work: Q4050665
cites work: On some arithmetical properties of middle binomial coefficients
cites work: Regularity of patterns in the factorization of n!
cites work: Sequences of low complexity: Automatic and Sturmian sequences
cites work: Ensembles presque périodiques \(k\)-reconnaissables. (Almost periodic \(k\)-recognizable sets)
cites work: Suites algébriques, automates et substitutions
cites work: Q3872548
cites work: Iteration of maps by an automaton
cites work: On Subword Complexity of Morphic Sequences
cites work: Continued fractions, best measurements, and musical scales and intervals
cites work: Subword complexities of various classes of deterministic developmental languages without interactions
cites work: On the Prime Factors of \binom2nn
cites work: Q5548368
cites work: Complexity of sequences and dynamical systems
cites work: Asymptotic subword complexity of fixed points of group substitutions
cites work: Primitive substitutive numbers are closed under rational multiplication
cites work: On the joint distribution of \(q\)-additive functions in residue classes
cites work: On stabilizers of infinite words
cites work: The 3x + 1 Problem and Its Generalizations
cites work: Sums and rational multiples of \(q\)-automatic sequences are \(q\)-automatic
cites work: On the vector space of the automatic reals
cites work: If a DOL language is k-power free then it is circular
cites work: On the distribution of \binom CnDn modulo p
cites work: On a problem of Granville and Zhu Regarding Pascal's triangle
cites work: Power of words and recognizability of fixpoints of a substitution
cites work: Reconnaissabilité des substitutions et complexité des suites automatiques
cites work: Complexité des facteurs des mots infinis engendrés par morphismes itérés
cites work: Substitution dynamical systems - spectral analysis
cites work: A Second Course in Formal Languages and Automata Theory
cites work: Q4524327
cites work: Characterizing regular languages with polynomial densities
DOI: 10.1016/J.TCS.2009.03.041
Recommended article: Reconnaissabilité des substitutions et complexité des suites automatiques
Recommended article: On the \(N\)th linear complexity of automatic sequences
Recommended article: Complexity of automatic sequences
Recommended article: On Subword Complexity of Morphic Sequences
Recommended article: Subword complexity and non-automaticity of certain completely multiplicative functions
Recommended article: The size of subsequence automaton
Recommended article: Automatic complexity of shift register sequences
Recommended article: The subword complexity of a two-parameter family of sequences
Recommended article: Q4345303
description: scientific article; zbMATH DE number 5602720