Ensembles presque périodiques \(k\)-reconnaissables. (Almost periodic \(k\)-recognizable sets)
From MaRDI portal
Publication:1255781
DOI10.1016/0304-3975(79)90011-2zbMath0402.68044OpenAlexW1971057901MaRDI QIDQ1255781
Publication date: 1979
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(79)90011-2
Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Automata sequences (11B85)
Related Items (69)
Linearization of automatic arrays and weave specifications ⋮ Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences ⋮ How to prove that a sequence is not automatic ⋮ Limit sets of automatic sequences. ⋮ On the maximum order complexity of Thue-Morse and Rudin-Shapiro sequences along polynomial values ⋮ Hyperquadratic continued fractions and automatic sequences ⋮ Bounded languages described by GF(2)-grammars ⋮ Automata and finite order elements in the Nottingham group ⋮ On the joint subword complexity of automatic sequences ⋮ Computing solutions of linear Mahler equations ⋮ On the context-freeness of the set of words containing overlaps ⋮ Semi-Galois categories. II: An arithmetic analogue of Christol's theorem ⋮ Rational digit systems over finite fields and Christol's theorem ⋮ Papers presented at the conference `XXIIIrd Journées Arithmétiques', Graz, Austria, July 6--12, 2003 ⋮ Automata and algebraicity ⋮ Pseudorandom sequences derived from automatic sequences ⋮ NOTES ON THE DPRM PROPERTY FOR LISTABLE STRUCTURES ⋮ Automorphisms of Harbater-Katz-Gabber curves ⋮ Automatic sequences and curves over finite fields ⋮ Note sur un article de Sharif et Woodcock ⋮ On the algebraicity of generalized power series ⋮ On the pseudorandomness of automatic sequences ⋮ Finite automata and algebraic extensions of functions fields ⋮ A Fibonacci type sequence with Prouhet–Thue–Morse coefficients ⋮ \(\beta\)-expansion and transcendence in \(\mathbb F_q((x^{-1}))\) ⋮ On the algebraicity of Thue–Morse and period-doubling continued fractions ⋮ Stieltjes continued fractions related to the paperfolding sequence and Rudin-Shapiro sequence ⋮ Thue, combinatorics on words, and conjectures inspired by the Thue-Morse sequence ⋮ A conjecture of Dekking on the dimensions of the lower central series factors of a certain just infinite Lie algebra ⋮ A note on multiplicative automatic sequences, II ⋮ (Non)Automaticity of number theoretic functions ⋮ Fast coefficient computation for algebraic power series in positive characteristic ⋮ Automata methods in transcendence ⋮ Transcendence of \(L(1,\chi_s)/\pi\) in positive characteristic. A simple automata-style proof ⋮ Monodromie unipotente maximale, congruences “à la Lucas” et indépendance algébrique ⋮ ON A CONJECTURE OF MCINTOSH REGARDING LP-SEQUENCES ⋮ Ostrowski-automatic sequences: theory and applications ⋮ Automaticity and Invariant Measures of Linear Cellular Automata ⋮ On some questions regarding \(k\)-regular and \(k\)-context-free sequences ⋮ An elementary approach to \(L\)-functions \(\text{mod }p\) ⋮ On vanishing coefficients of algebraic power series over fields of positive characteristic ⋮ Arithmetic of Gamma, Zeta and Multizeta Values for Function Fields ⋮ On a two-valued sequence and related continued fractions in power series fields ⋮ On the \(N\)th linear complexity of automatic sequences ⋮ Unnamed Item ⋮ On certain recurrent and automatic sequences in finite fields ⋮ Function fields in positive characteristic: expansions and Cobham's theorem ⋮ Automata, algebraicity and distribution of sequences of powers. ⋮ AUTOMATICITY OF COARSE-GRAINING INVARIANT ORBITS OF ONE-DIMENSIONAL LINEAR CELLULAR AUTOMATA ⋮ Cobham’s theorem and its extensions ⋮ Formal languages over GF(2) ⋮ Mock characters and the Kronecker symbol ⋮ Unnamed Item ⋮ Substitutive systems and a finitary version of Cobham's theorem ⋮ Irrationality measures for some automatic real numbers ⋮ Multiplicative automatic sequences ⋮ Transcendence of formal power series with rational coefficients ⋮ Suites algébriques, automates et substitutions ⋮ On the automaticity of the Hankel determinants of a family of automatic sequences ⋮ Diophantine approximation of Mahler numbers ⋮ A note on multiplicative automatic sequences ⋮ Support of an algebraic series as the range of a recursive sequence ⋮ Symmetries of decimation invariant sequences and digit sets. ⋮ Automates finis et ensembles normaux. (Finite automata and normal sets) ⋮ Linear Complexity and Expansion Complexity of Some Number Theoretic Sequences ⋮ Multiplicative functions and \(k\)-automatic sequences ⋮ A refinement of Christol's theorem for algebraic power series ⋮ On synchronized sequences and their separators ⋮ Some transcendental functions over function fields with positive characteristic.
Cites Work
This page was built for publication: Ensembles presque périodiques \(k\)-reconnaissables. (Almost periodic \(k\)-recognizable sets)
