Uniform tag sequences
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3114014 (Why is no real title available?)
- scientific article; zbMATH DE number 3116692 (Why is no real title available?)
- scientific article; zbMATH DE number 3144516 (Why is no real title available?)
- scientific article; zbMATH DE number 3201659 (Why is no real title available?)
- scientific article; zbMATH DE number 3246281 (Why is no real title available?)
- scientific article; zbMATH DE number 3293666 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- scientific article; zbMATH DE number 3032896 (Why is no real title available?)
- scientific article; zbMATH DE number 3036407 (Why is no real title available?)
- Decision Problems of Finite Automata Design and Related Arithmetics
- Endomorphisms and automorphisms of the shift dynamical system
- Finite Automata and the Set of Squares
- Finitely additive measures and the first digit problem
- Generalized Morse sequences
- On digital distribution in some integer sequences
- On the Computational Complexity of Algorithms
- On the Number of Binary Digits in a Multiple of Three
- On the Probability that a Random Integer has Initial Digit A
- On the Recognition of Primes by Automata
- On the base-dependence of sets of numbers recognizable by finite automata
- Records of turing machines
- Sequential Functions
- Time-restricted sequence generation
- Unrecognizable Sets of Numbers
- Weak Second‐Order Arithmetic and Finite Automata
Cited in
(only showing first 100 items - show all)- Dumont-Thomas complement numeration systems for \(\mathbb{Z}\)
- The sum of digits of squares
- Tours de Hanoï et automates
- Aperiodicity Measure for Infinite Sequences
- On the complexity of infinite words generated by countable \(q\)-automata
- Decision algorithms for Fibonacci-automatic words. I: Basic results.
- SELF-SIMILAR STRUCTURE OF RESCALED EVOLUTION SETS OF CELLULAR AUTOMATA II
- Cubic pisot unit combinatorial games
- A two-valued recurrent double sequence that is not automatic
- Automatic sequences and transcendence in positive characteristic
- Linearization of automatic arrays and weave specifications
- scientific article; zbMATH DE number 7453075 (Why is no real title available?)
- On sequences resulting from iteration of modified quadratic and palindromic mappings
- Separators in infinite words generated by morphisms.
- ON THE REPETITIVITY INDEX OF INFINITE WORDS
- Classes of formal grammars
- Tag systems generating Thue irreductible sequences
- A morphic approach to combinatorial games: the Tribonacci case
- Magic Numbers in Periodic Sequences
- Rudin-Shapiro Sums via Automata Theory and Logic
- On automatic infinite permutations
- Hartmanis-Stearns Conjecture on Real Time and Transcendence
- Enumeration and decidable properties of automatic sequences
- Polynomial subsequences of certain automatic sequences
- On factors of synchronized sequences
- Regular sequences and the joint spectral radius
- A characterization of \(p\)-automatic sequences as columns of linear cellular automata
- General framework
- Bertrand numeration systems and recognizability
- Automatic walks
- Asymptotic properties of free monoid morphisms
- Sur des points fixes de morphismes d'un monoïde libre
- Le p-pliage de papier
- Sum of digits and change of base
- Spectral theory of regular sequences
- Mots sans carre et morphismes iterés
- Invertible substitutions on a three-letter alphabet.
- Automatic sets of rational numbers
- Subword complexity and finite characteristic numbers
- Minimum complexity of automatic non sturmian sequences
- Sur l'ensemble normal des substitutions de longueur quelconque. (On the normal set of substitutions of arbitrary length)
- The structure of invertible substitutions on a three-letter alphabet
- A generalization of automatic sequences
- The structure of invertible substitutions on a three-letter alphabet
- Decimation-invariant sequences and their automaticity
- Automatic sequences based on Parry or Bertrand numeration systems
- Automatic Dirichlet series
- Entropy rates and finite-state dimension
- Relative position in binary substitutions
- Automatic sequences and generalised polynomials
- Hyperquadratic continued fractions and automatic sequences
- Decidability questions related to abstract numeration systems
- A new approach to the 2-regularity of the \(\ell\)-abelian complexity of 2-automatic sequences
- On the finite factorial numbers
- Multiplicative automatic sequences
- Recognizable sets of numbers in nonstandard bases
- Transcendence of \(L(1,\chi_{s})/\Pi\) and automata
- Mechanical proofs of properties of the Tribonacci word
- Subword complexity of a generalized Thue-Morse word
- Quelles tuiles ! (Pavages apériodiques du plan et automates bidimensionnels)
- Arithmetics properties of substitutions and infinite automata
- Linear cellular automata, finite automata and Pascal's triangle
- Self-similar tiling systems, topological factors and stretching factors
- Drunken man infinite words complexity
- Automatic sequences: from rational bases to trees
- The upper density of an automatic set is rational
- Systèmes de numération et fonctions fractales relatifs aux substitutions. (Numeration systems and fractal functions related to substitutions)
- The ring of k-regular sequences
- Lamination languages
- Transcendence of power series for some number theoretic functions
- Pattern spectra, substring enumeration, and automatic sequences
- Some improvements of the S-adic conjecture
- Subsequences of automatic sequences indexed by n^c and correlations
- Canonical positions for the factors in paperfolding sequences
- About frequencies of letters in generalized automatic sequences
- Iterative devices generating infinite words
- On the triplex substitution -- combinatorial properties
- On completely multiplicative automatic sequences
- On complexity functions of infinite words associated with generalized Dyck languages
- A characterization of substitutive sequences using return words
- How to prove that a sequence is not automatic
- Automatic sequences and parity of partition functions
- The asymptotic distribution of elements in automatic sequences
- Sumsets and fixed points of substitutions
- On k-regularity of sequences of valuations and last non-zero digits
- On a sequence related to that of Thue-Morse and its applications
- The Thue-Morse continued fractions in characteristic 2 are algebraic
- Complexity of automatic sequences
- Hankel determinants of the Thue-Morse sequence
- On recognizable sets of integers
- On a family of automatic apwenian sequences
- Transcendence of formal power series with rational coefficients
- On the computational complexity of algebraic numbers: the Hartmanis-Stearns problem revisited
- Iteration of maps by an automaton
- On the automaticity of the Hankel determinants of a family of automatic sequences
- Multidimensional generalized automatic sequences and shape-symmetric morphic words
- Automata transformations of prefix decidable and decidable by Buchi superwords
- The signature of rational languages
- Subword complexity and non-automaticity of certain completely multiplicative functions
- Rudin-Shapiro sums via automata theory and logic
This page was built for publication: Uniform tag sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5666530)
