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
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, Prefix palindromic length of the Thue-Morse word, Hidden automatic sequences, Sumsets and fixed points of substitutions, NOTES ON THE DPRM PROPERTY FOR LISTABLE STRUCTURES, Properties of infinite words : Recent results, Recognizable sets of numbers in nonstandard bases, Iterative devices generating infinite words, Automatic sequences: from rational bases to trees, On extended boundary sequences of morphic and Sturmian words, Magic Numbers in Periodic Sequences, Rudin-Shapiro Sums via Automata Theory and Logic, Automaticity and Parikh-Collinear Morphisms, Characteristic Sequences of the Sets of Sums of Squares as Columns of Cellular Automata, On \(k\)-regularity of sequences of valuations and last non-zero digits, Transduction of automatic sequences and applications, Automaticity and Invariant Measures of Linear Cellular Automata, DEGREE-ONE MAHLER FUNCTIONS: ASYMPTOTICS, APPLICATIONS AND SPECULATIONS, From Combinatorial Games to Shape-Symmetric Morphisms, Automorphisms of automatic shifts, Complexity of automatic sequences, Substitutions par des motifs en dimension 1, A list of arithmetical structures complete with respect to the first-order definability, Decimation-invariant sequences and their automaticity, Cobham’s Theorem and Automaticity, Automatic Sequences and Generalised Polynomials, SELF-SIMILAR STRUCTURE OF RESCALED EVOLUTION SETS OF CELLULAR AUTOMATA II, A generalization of automatic sequences, Diophantine approximation of Mahler numbers, How to prove that a sequence is not automatic, Decidability questions related to abstract numeration systems, Hartmanis-Stearns Conjecture on Real Time and Transcendence, The structure of invertible substitutions on a three-letter alphabet, Automatic sequences of rank two, Continued fractions with low complexity: transcendence measures and quadratic approximation, Automata and finite order elements in the Nottingham group, Spectral theory of regular sequences, 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, Mechanical Proofs of Properties of the Tribonacci Word, Syndeticity and independent substitutions, On automatic infinite permutations, On the Recognizability of Self-generating Sets, The number of factors in a paperfolding sequence, Decision algorithms for Fibonacci-automatic Words, I: Basic results, Papers presented at the conference `XXIIIrd Journées Arithmétiques', Graz, Austria, July 6--12, 2003, Automata and algebraicity, THE MINIMAL GROWTH OF A -REGULAR SEQUENCE, A New Approach to the Paperfolding Sequences, On a universal extraction procedure, \(\beta\)-shift, numeration systems, and automata, Prefix palindromic length of the Sierpinski word, Tours de Hanoï et automates, Linear cellular automata, finite automata and Pascal's triangle, Special factors of automatic sequences, A result about languages concerning paperfolding sequences, Marches sur les arbres homogènes suivant une suite substitutive, Sur la transcendance de la série formelle Π, On completely multiplicative automatic sequences, Decidability Problems for Self-induced Systems Generated by a Substitution, Automatic Sets of Rational Numbers, Rudin–Shapiro sequences along squares, Deterministic functions on amenable semigroups and a generalization of the Kamae-Weiss theorem on normality preservation, Minimum complexity of automatic non sturmian sequences, Sur les centres de DOL-langages, Automata methods in transcendence, A morphic approach to combinatorial games: the Tribonacci case, An algorithm for periodicity and almost periodicity of uniform substitution sequences and its implications on aperiodic spin models, Sur le développement en fraction continue de la série de Baum et Sweet, A two-valued recurrent double sequence that is not automatic, Drunken man infinite words complexity, The upper density of an automatic set is rational, General Framework, Unnamed Item, The first return time properties of an irrational rotation, Look and Say Fibonacci, Ostrowski-automatic sequences: theory and applications, Rank and symbolic complexity, Automatic Dirichlet series, Le p-pliage de papier, On prefix palindromic length of automatic words, ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES, On the subword complexity of Thue-Morse polynomial extractions, Unnamed Item, On the Number of Unbordered Factors, Cobham-Semenov theorem and \(\mathbb N^d\)-subshifts, Equivalence of right infinite words, Modularity in the semilattice of \(\omega \)-words, Automatic sequences based on Parry or Bertrand numeration systems, A new approach to the 2-regularity of the \(\ell\)-abelian complexity of 2-automatic sequences, Sur quelques classes d’applications de $N^2$ dans les ensembles finis, Sur des points fixes de morphismes d'un monoïde libre, Unnamed Item, Characterizing Cantorian sets by entropy‐like quantities, On the complexity of algebraic numbers. II: Continued fractions, Quelles tuiles ! (Pavages apériodiques du plan et automates bidimensionnels), AUTOMATICITY OF COARSE-GRAINING INVARIANT ORBITS OF ONE-DIMENSIONAL LINEAR CELLULAR AUTOMATA, Cobham’s theorem and its extensions, A Characterization of Multidimensional <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>S</mml:mi></mml:math>-Automatic Sequences, Subword complexity and finite characteristic numbers, The Critical Exponent is Computable for Automatic Sequences, Minimal automaton for multiplying and translating the Thue-Morse set, On the computational complexity of algebraic numbers: the Hartmanis–Stearns problem revisited, Transcendence of power series for some number theoretic functions, The Formal Inverse of the Period-Doubling Sequence, ON THE REPETITIVITY INDEX OF INFINITE WORDS, Regular Sequences and the Joint Spectral Radius, Aperiodicity Measure for Infinite Sequences, Nombres réels de complexité sous-linéaire : mesures d'irrationalité et de transcendance, Substitutive systems and a finitary version of Cobham's theorem, Regular sequences and synchronized sequences in abstract numeration systems, Irrationality measures for some automatic real numbers, ON UNIFORMLY RECURRENT MORPHIC SEQUENCES, The structure of invertible substitutions on a three-letter alphabet, Multiplicative automatic sequences, Production en temps réel et complexité de structure de suites infinies, Life and Mathematics of Alfred Jacobus van der Poorten (1942–2010), Decidability and \(k\)-regular sequences, Suites algébriques, automates et substitutions, On the automaticity of the Hankel determinants of a family of automatic sequences, Sum of digits and change of base, A method of Mahler in transcendence theory and some of its applications, Support of an algebraic series as the range of a recursive sequence, The Ellis semigroup of certain constant-length substitutions, (Logarithmic) densities for automatic sequences along primes and squares, The simplest binary word with only three squares, Lamination languages, On synchronized sequences and their separators
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
