Uniform tag sequences
From MaRDI portal
Publication:5666530
DOI10.1007/BF01706087zbMath0253.02029MaRDI QIDQ5666530
Publication date: 1972
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Related Items (only showing first 100 items - show all)
Linearization of automatic arrays and weave specifications ⋮ Limit sets of automatic sequences. ⋮ Asymptotic properties of free monoid morphisms ⋮ Canonical positions for the factors in paperfolding sequences ⋮ On the complexity of algebraic numbers ⋮ Hyperquadratic continued fractions and automatic sequences ⋮ Automata calculating the complexity of automatic sequences ⋮ Automata transformations of prefix decidable and decidable by Buchi superwords ⋮ About the \(p\)-paperfolding words ⋮ New second-preimage attacks on hash functions ⋮ Quasicrystal Ising chain and automata theory ⋮ On the subword equivalence problem for morphic words ⋮ Sur l'ensemble normal des substitutions de longueur quelconque. (On the normal set of substitutions of arbitrary length) ⋮ Uniform tag systems for paperfolding sequences ⋮ Measure-theoretic complexity of ergodic systems ⋮ A generalization of automatic sequences ⋮ On a sequence related to that of Thue-Morse and its applications ⋮ The origins of combinatorics on words ⋮ Transcendence of numbers with a low complexity expansion ⋮ A characterization of substitutive sequences using return words ⋮ Systèmes de numération et fonctions fractales relatifs aux substitutions. (Numeration systems and fractal functions related to substitutions) ⋮ Morphisms on infinite alphabets, countable states automata and regular sequences ⋮ 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 ⋮ On the regularity of \(\{\lfloor \log_b(\alpha n+\beta)\rfloor\}_{n\geq 0}\) ⋮ The sum of digits of squares ⋮ On factors of synchronized sequences ⋮ The asymptotic distribution of elements in automatic sequences ⋮ Mots sans carre et morphismes iterés ⋮ Properties and limits of recognition of sets of integers by countable automata ⋮ (Non)Automaticity of number theoretic functions ⋮ Sturmian images of non Sturmian words and standard morphisms ⋮ The Morse sequence and iterated morphisms ⋮ Subsequences of automatic sequences indexed by \(\lfloor n^c \rfloor\) and correlations ⋮ On a sequence of rational functions ⋮ Some improvements of the \(S\)-adic conjecture ⋮ Folds! ⋮ Folds! II: Symmetry disturbed ⋮ Folds! III: More morphisms ⋮ The ring of \(k\)-regular sequences. II. ⋮ Normality along squares ⋮ A characterization of \(p\)-automatic sequences as columns of linear cellular automata ⋮ Digital sum problems and substitutions on a finite alphabet ⋮ On the regularity of the Hankel determinant sequence of the characteristic sequence of powers of 2 ⋮ Another generalization of abelian equivalence: binomial complexity of infinite words ⋮ On the vector space of the automatic reals ⋮ On the triplex substitution -- combinatorial properties ⋮ Subword complexity of a generalized Thue-Morse word ⋮ Substitutions and \(\beta\) systems of numeration ⋮ Criteria for regularity of Mahler power series and Becker's conjecture ⋮ Pattern spectra, substring enumeration, and automatic sequences ⋮ Some studies on the \((p,q)\)-type sequences ⋮ Profinite automata ⋮ Relations on words ⋮ Automaticity. IV: Sequences, sets, and diversity ⋮ Automatic maps in exotic numeration systems ⋮ Transcendence of \(L(1,\chi_{s})/\Pi\) and automata ⋮ The ring of \(k\)-regular sequences ⋮ On certain recurrent and automatic sequences in finite fields ⋮ On complexity functions of infinite words associated with generalized Dyck languages ⋮ Automatic sequences and transcendence in positive characteristic ⋮ Direct definition of a ternary infinite square-free sequence ⋮ Extensions and restrictions of Wythoff's game preserving its \(\mathcal P\) positions ⋮ Multidimensional generalized automatic sequences and shape-symmetric morphic words ⋮ On a problem of Gelfond: the sum of digits of prime numbers ⋮ The signature of rational languages ⋮ Subword complexity and non-automaticity of certain completely multiplicative functions ⋮ Classes of formal grammars ⋮ Tag systems generating Thue irreductible sequences ⋮ Self-similar tiling systems, topological factors and stretching factors ⋮ Automaticity of the Hankel determinants of difference sequences of the Thue-Morse sequence ⋮ Logarithmic frequency in morphic sequences ⋮ Hankel determinants of the Thue-Morse sequence ⋮ Cubic pisot unit combinatorial games ⋮ About frequencies of letters in generalized automatic sequences ⋮ On recognizable sets of integers ⋮ An infinite square-free co-CFL ⋮ On the complexity of a family of \(k\)-context-free sequences ⋮ On a possible classification of real-time constructed sequences ⋮ Infinite words with linear subword complexity ⋮ Generalization of automatic sequences for numeration systems on a regular language ⋮ Transcendence of formal power series with rational coefficients ⋮ Hierarchie et fermeture de certaines classes de tag-systèmes ⋮ An equivalence relation on \(\{ 0,1\}^*\) ⋮ Toeplitz sequences, \(p\)-paperfolding, automatic sequences and polynomials ⋮ Palindrome complexity. ⋮ On regularity of languages generated by copying systems ⋮ Automatic walks ⋮ Polynomial subsequences of certain automatic sequences ⋮ Automates finis et ensembles normaux. (Finite automata and normal sets) ⋮ Note on the cyclic towers of Hanoi ⋮ On the number of factors of Sturmian words ⋮ Iteration of maps by an automaton ⋮ Multiplicative functions and \(k\)-automatic sequences ⋮ Complexity of generalized Rudin-Shapiro sequences ⋮ Invertible substitutions on a three-letter alphabet. ⋮ Entropy rates and finite-state dimension
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Time-restricted sequence generation
- Sequential Functions
- Weak Second‐Order Arithmetic and Finite Automata
- Decision Problems of Finite Automata Design and Related Arithmetics
- On the Computational Complexity of Algorithms
- On digital distribution in some integer sequences
- On the Probability that a Random Integer has Initial Digit A
- Generalized Morse sequences
- On the Recognition of Primes by Automata
- Unrecognizable Sets of Numbers
- On the base-dependence of sets of numbers recognizable by finite automata
- Finitely additive measures and the first digit problem
- Endomorphisms and automorphisms of the shift dynamical system
- On the Number of Binary Digits in a Multiple of Three
- Records of turing machines
- Finite Automata and the Set of Squares
This page was built for publication: Uniform tag sequences
