Arithmetics properties of substitutions and infinite automata
From MaRDI portal
Publication:2372784
DOI10.5802/aif.2248zbMath1147.11016OpenAlexW2519649924MaRDI QIDQ2372784
Publication date: 1 August 2007
Published in: Annales de l'Institut Fourier (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=AIF_2006__56_7_2525_0
Related Items (15)
Substitution dynamical systems on infinite alphabets ⋮ On the complexity of infinite words generated by countable \(q\)-automata ⋮ PROPRIÉTÉS LOCALES DES CHIFFRES DES NOMBRES PREMIERS ⋮ Automatic sequences as good weights for ergodic theorems ⋮ Morphisms on infinite alphabets, countable states automata and regular sequences ⋮ Properties and limits of recognition of sets of integers by countable automata ⋮ Substitution-dynamics and invariant measures for infinite alphabet-path space ⋮ Drunken man infinite words complexity ⋮ Profinite automata ⋮ On complexity functions of infinite words associated with generalized Dyck languages ⋮ Weyl sums over integers with affine digit restrictions ⋮ The stable set of a self-map ⋮ On the complexity of a family of \(k\)-context-free sequences ⋮ Avoiding squares and overlaps over the natural numbers ⋮ Polynomial values and generators with missing digits in finite fields
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Substitutions in dynamics, arithmetics and combinatorics
- Automates finis et ensembles normaux. (Finite automata and normal sets)
- Substitution dynamical systems - spectral analysis
- Sur l'ensemble normal des substitutions de longueur quelconque. (On the normal set of substitutions of arbitrary length)
- Caractérisation des ensembles normaux substitutifs. (Characterization of normal substitutional sets)
- On the uniform distribution modulo one of subsequences of polynomial sequences. II
- On the uniform distribution modulo one of some subsequences of polynomial sequences
- On arithmetic properties of integers with missing digits. I: Distribution in residue classes
- Complexity and special factors
- On arithmetic properties of integers with missing digits. II: Prime factors
- Generating functions for generating trees
- Basic analytic combinatorics of directed lattice paths
- Graphes connexes représentation des entiers et équirepartition
- Character sums over integers with restricted \(g\)-ary digits
- Almost primes whose expansion in base \(r\) misses some digits
- On the complexity of infinite words generated by countable \(q\)-automata
- Integers with an average sum of digits
- Automatic Sequences
- Arithmetic properties of numbers with restricted digits
- Squarefree values of polynomials all of whose coefficients are 0 and 1
- Mathematical Foundations of Computer Science 2003
- Unrecognizable Sets of Numbers
- On the base-dependence of sets of numbers recognizable by finite automata
- Uniform tag sequences
- Finite Automata and the Set of Squares
- On the number of prime factors of integers characterized by digit properties
- Arithmetic properties of integers with missing digits: distribution in residue classes
- Zero-density sets containing integers with at most two prime factors
This page was built for publication: Arithmetics properties of substitutions and infinite automata
