Uniform tag sequences

From MaRDI portal

Publication:5666530

Jump to:navigation, search

DOI10.1007/BF01706087zbMath0253.02029MaRDI QIDQ5666530

Alan Cobham

Publication date: 1972

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

11B85: Automata sequences

03D03: Thue and Post systems, etc.

Related Items

Linearization of automatic arrays and weave specifications, Asymptotic properties of free monoid morphisms, Hyperquadratic continued fractions and automatic sequences, Automata transformations of prefix decidable and decidable by Buchi superwords, New second-preimage attacks on hash functions, On factors of synchronized sequences, Subsequences of automatic sequences indexed by \(\lfloor n^c \rfloor\) and correlations, A characterization of \(p\)-automatic sequences as columns of linear cellular automata, Another generalization of abelian equivalence: binomial complexity of infinite words, Criteria for regularity of Mahler power series and Becker's conjecture, Profinite automata, Relations on words, On certain recurrent and automatic sequences in finite fields, The sum of digits of squares, Properties and limits of recognition of sets of integers by countable automata, (Non)Automaticity of number theoretic functions, Some improvements of the \(S\)-adic conjecture, On the regularity of the Hankel determinant sequence of the characteristic sequence of powers of 2, On the vector space of the automatic reals, Subword complexity of a generalized Thue-Morse word, Substitutions and \(\beta\) systems of numeration, Automaticity. IV: Sequences, sets, and diversity, Automatic maps in exotic numeration systems, Automatic sequences and transcendence in positive characteristic, The signature of rational languages, Subword complexity and non-automaticity of certain completely multiplicative functions, Automaticity of the Hankel determinants of difference sequences of the Thue-Morse sequence, An infinite square-free co-CFL, On the complexity of a family of \(k\)-context-free sequences, On regularity of languages generated by copying systems, On the number of factors of Sturmian words, Entropy rates and finite-state dimension, On a sequence related to that of Thue-Morse and its applications, The origins of combinatorics on words, On a sequence of rational functions, On the triplex substitution -- combinatorial properties, On complexity functions of infinite words associated with generalized Dyck languages, 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, 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, A generalization of automatic sequences, 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, 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, Cobham’s Theorem and Automaticity, Automatic Sequences and Generalised Polynomials, Diophantine approximation of Mahler numbers, Prefix palindromic length of the Thue-Morse word, Substitutions par des motifs en dimension 1, SELF-SIMILAR STRUCTURE OF RESCALED EVOLUTION SETS OF CELLULAR AUTOMATA II, Complexity of automatic sequences, A list of arithmetical structures complete with respect to the first-order definability, Decimation-invariant sequences and their automaticity, 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, Unnamed Item, Rudin–Shapiro sequences along squares, General Framework, 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 Formal Inverse of the Period-Doubling Sequence, The structure of invertible substitutions on a three-letter alphabet, Production en temps réel et complexité de structure de suites infinies, Minimum complexity of automatic non sturmian sequences, Sur le développement en fraction continue de la série de Baum et Sweet, Unnamed Item, Rank and symbolic complexity, ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES, On the Number of Unbordered Factors, Characterizing Cantorian sets by entropy‐like quantities, AUTOMATICITY OF COARSE-GRAINING INVARIANT ORBITS OF ONE-DIMENSIONAL LINEAR CELLULAR AUTOMATA, On the computational complexity of algebraic numbers: the Hartmanis–Stearns problem revisited, Regular Sequences and the Joint Spectral Radius, 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, Automatic sequences of rank two, 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, 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, The Critical Exponent is Computable for Automatic Sequences, Life and Mathematics of Alfred Jacobus van der Poorten (1942–2010), Lamination languages, Hartmanis-Stearns Conjecture on Real Time and Transcendence, Continued fractions with low complexity: transcendence measures and quadratic approximation, On automatic infinite permutations, THE MINIMAL GROWTH OF A -REGULAR SEQUENCE, Decidability Problems for Self-induced Systems Generated by a Substitution, Automatic Sets of Rational Numbers, Sur quelques classes d’applications de $N^2$ dans les ensembles finis, Sur des points fixes de morphismes d'un monoïde libre, Nombres réels de complexité sous-linéaire : mesures d'irrationalité et de transcendance, On synchronized sequences and their separators, On the Recognizability of Self-generating Sets, Decision algorithms for Fibonacci-automatic Words, I: Basic results, A New Approach to the Paperfolding Sequences, Quelles tuiles ! (Pavages apériodiques du plan et automates bidimensionnels), Aperiodicity Measure for Infinite Sequences, Mechanical Proofs of Properties of the Tribonacci Word, Tours de Hanoï et automates, Sur la transcendance de la série formelle Π, A morphic approach to combinatorial games: the Tribonacci case, Drunken man infinite words complexity, The first return time properties of an irrational rotation, Look and Say Fibonacci, Unnamed Item, Transcendence of power series for some number theoretic functions, ON THE REPETITIVITY INDEX OF INFINITE WORDS, Irrationality measures for some automatic real numbers, ON UNIFORMLY RECURRENT MORPHIC SEQUENCES, A method of Mahler in transcendence theory and some of its applications, Sur les centres de DOL-langages, Le p-pliage de papier, Suites algébriques, automates et substitutions, The number of factors in a paperfolding sequence, A result about languages concerning paperfolding sequences, Marches sur les arbres homogènes suivant une suite substitutive

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5666530&oldid=30360426"