Uniform tag sequences
From MaRDI portal
Cites work
- 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
- 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?)
- On digital distribution in some integer sequences
- On the base-dependence of sets of numbers recognizable by finite automata
- 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
- 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)- Self-similar tiling systems, topological factors and stretching factors
- Logarithmic frequency in morphic sequences
- Cubic pisot unit combinatorial games
- About frequencies of letters in generalized automatic sequences
- Automates finis et ensembles normaux. (Finite automata and normal sets)
- Quasicrystal Ising chain and automata theory
- Sur l'ensemble normal des substitutions de longueur quelconque. (On the normal set of substitutions of arbitrary length)
- A generalization of automatic sequences
- Systèmes de numération et fonctions fractales relatifs aux substitutions. (Numeration systems and fractal functions related to substitutions)
- Mots sans carre et morphismes iterés
- The Morse sequence and iterated morphisms
- Folds!
- Folds! II: Symmetry disturbed
- Folds! III: More morphisms
- Digital sum problems and substitutions on a finite alphabet
- Pattern spectra, substring enumeration, and automatic sequences
- Some studies on the (p,q)-type sequences
- The ring of k-regular sequences
- Classes of formal grammars
- Tag systems generating Thue irreductible sequences
- Hankel determinants of the Thue-Morse sequence
- On recognizable sets of integers
- Transcendence of formal power series with rational coefficients
- Toeplitz sequences, \(p\)-paperfolding, automatic sequences and polynomials
- Automatic walks
- Polynomial subsequences of certain automatic sequences
- Note on the cyclic towers of Hanoi
- Iteration of maps by an automaton
- Complexity of generalized Rudin-Shapiro sequences
- Canonical positions for the factors in paperfolding sequences
- Automata calculating the complexity of automatic sequences
- About the p-paperfolding words
- On the subword equivalence problem for morphic words
- Uniform tag systems for paperfolding sequences
- Measure-theoretic complexity of ergodic systems
- Transcendence of numbers with a low complexity expansion
- A characterization of substitutive sequences using return words
- On sequences resulting from iteration of modified quadratic and palindromic mappings
- Automaticity of double sequences generated by one-dimensional linear cellular automata
- Separators in infinite words generated by morphisms.
- Bertrand numeration systems and recognizability
- On the factors of automatic words
- The asymptotic distribution of elements in automatic sequences
- The ring of \(k\)-regular sequences. II.
- Generalization of automatic sequences for numeration systems on a regular language
- An equivalence relation on \(\{ 0,1\}^*\)
- Multiplicative functions and \(k\)-automatic sequences
- Morphisms on infinite alphabets, countable states automata and regular sequences
- On the regularity of \(\{\lfloor \log_b(\alpha n+\beta)\rfloor\}_{n\geq 0}\)
- Sturmian images of non Sturmian words and standard morphisms
- Normality along squares
- Transcendence of \(L(1,\chi_{s})/\Pi\) and automata
- On a possible classification of real-time constructed sequences
- Infinite words with linear subword complexity
- Hierarchie et fermeture de certaines classes de tag-systèmes
- Palindrome complexity.
- Invertible substitutions on a three-letter alphabet.
- Limit sets of automatic sequences.
- On the complexity of algebraic numbers
- Decidability questions related to abstract numeration systems
- The structure of invertible substitutions on a three-letter alphabet
- On a universal extraction procedure
- \(\beta\)-shift, numeration systems, and automata
- Linear cellular automata, finite automata and Pascal's triangle
- Special factors of automatic sequences
- Automatic Dirichlet series
- Automatic sequences based on Parry or Bertrand numeration systems
- Minimal automaton for multiplying and translating the Thue-Morse set
- Substitutive systems and a finitary version of Cobham's theorem
- Regular sequences and synchronized sequences in abstract numeration systems
- Multiplicative automatic sequences
- Decidability and \(k\)-regular sequences
- Support of an algebraic series as the range of a recursive sequence
- How to prove that a sequence is not automatic
- Automata and finite order elements in the Nottingham group
- Spectral theory of regular sequences
- Prefix palindromic length of the Sierpinski word
- On completely multiplicative automatic sequences
- Automata methods in transcendence
- The upper density of an automatic set is rational
- Ostrowski-automatic sequences: theory and applications
- On prefix palindromic length of automatic words
- Equivalence of right infinite words
- Modularity in the semilattice of \(\omega \)-words
- A new approach to the 2-regularity of the \(\ell\)-abelian complexity of 2-automatic sequences
- On the automaticity of the Hankel determinants of a family of automatic sequences
- Sum of digits and change of base
- Indian kolam patterns, sand drawings in the Vanuatu Islands, the Sierpiński curve, and monoid morphisms
- On the complexity of infinite words generated by countable \(q\)-automata
- Arithmetics properties of substitutions and infinite automata
- Syndeticity and independent substitutions
- Papers presented at the conference `XXIIIrd Journées Arithmétiques', Graz, Austria, July 6--12, 2003
- Automata and algebraicity
- A two-valued recurrent double sequence that is not automatic
- On the subword complexity of Thue-Morse polynomial extractions
- Cobham-Semenov theorem and \(\mathbb N^d\)-subshifts
- On the complexity of algebraic numbers. II: Continued fractions
- Linearization of automatic arrays and weave specifications
- Deterministic functions on amenable semigroups and a generalization of the Kamae-Weiss theorem on normality preservation
- An algorithm for periodicity and almost periodicity of uniform substitution sequences and its implications on aperiodic spin models
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)
