How to prove that a sequence is not automatic
From MaRDI portal
Publication:2121041
DOI10.1016/j.exmath.2021.08.001zbMath1497.11063arXiv2104.13072OpenAlexW3197993857MaRDI QIDQ2121041
Jeffrey O. Shallit, Jean-Paul Allouche, Reem Yassawi
Publication date: 1 April 2022
Published in: Expositiones Mathematicae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.13072
Related Items (3)
Pseudorandom sequences derived from automatic sequences ⋮ Bracket words: A generalisation of Sturmian words arising from generalised polynomials ⋮ Characteristic Sequences of the Sets of Sums of Squares as Columns of Cellular Automata
Uses Software
Cites Work
- (Non)Automaticity of number theoretic functions
- Cobham's theorem for substitutions
- Automaticity. IV: Sequences, sets, and diversity
- Substitutions in dynamics, arithmetics and combinatorics
- Characteristic Sturmian words are extremal for the critical factorization theorem
- Subword complexity and non-automaticity of certain completely multiplicative functions
- Sum-free sets generated by the period-\(k\)-folding sequences and some Sturmian sequences
- Substitution dynamical systems. Spectral analysis
- Finite automata in number theory
- Transcendence of the Carlitz-Goss gamma function at rational arguments
- Power of words and recognizability of fixpoints of a substitution
- Ensembles presque périodiques \(k\)-reconnaissables. (Almost periodic \(k\)-recognizable sets)
- Pascal's triangle, complexity and automata
- Carlitz \(\zeta\)-function and automata
- Polynomial subsequences of certain automatic sequences
- Note on the cyclic towers of Hanoi
- Transcendence and the Carlitz-Goss gamma function
- Automaticity of double sequences generated by one-dimensional linear cellular automata
- Separators in infinite words generated by morphisms.
- Endomorphic presentations of branch groups.
- Multiplicative functions and \(k\)-automatic sequences
- Some transcendental functions over function fields with positive characteristic.
- Normality along squares
- Transcendence of \(L(1,\chi_{s})/\Pi\) and automata
- Factors of generalised polynomials and automatic sequences
- Self-generating sets, integers with missing blocks, and substitutions
- Plane digitization and related combinatorial problems
- Mock characters and the Kronecker symbol
- Automatic sequences
- On the complexity of algebraic numbers
- Linear combinations of \(\zeta(s)/ \Pi^ s\) over \(F_ q(x)\) for \(1\leq s\leq q-2\)
- Automatic Dirichlet series
- Substitutive systems and a finitary version of Cobham's theorem
- On completely multiplicative automatic sequences
- Automaticity of the sequence of the last nonzero digits of \(n!\) in a fixed base
- The upper density of an automatic set is rational
- Periodicity, repetitions, and orbits of an automatic sequence
- A note on multiplicative automatic sequences
- Indian kolam patterns, sand drawings in the Vanuatu Islands, the Sierpiński curve, and monoid morphisms
- On the subword complexity of Thue-Morse polynomial extractions
- On the complexity of algebraic numbers. II: Continued fractions
- A topological invariant of substitution minimal sets
- On the complexity of algebraic numbers. I: Expansions in integer bases
- Complexité et automates cellulaires linéaires
- Transcendence, automata theory and gamma functions for polynomial rings
- Subword complexity and Laurent series with coefficients in a finite field
- PROFINITE COMPLETION OF GRIGORCHUK'S GROUP IS NOT FINITELY PRESENTED
- Valeurs propres des systèmes dynamiques définis par des substitutions de longueur variable
- Sur des points fixes de morphismes d'un monoïde libre
- Critères de non-automaticité et leurs applications
- On synchronized sequences and their separators
- Automates et valeurs de transcendance du logarithme de Carlitz
- Sur la transcendance de la série formelle Π
- THE TWISTED TWIN OF THE GRIGORCHUK GROUP
- ON THE REPETITIVITY INDEX OF INFINITE WORDS
- Suites algébriques, automates et substitutions
- The spectrum of dynamical systems arising from substitutions of constant length
- Modules de Drinfeld formels et algébricité
- Automata and transcendence of the Tate period in finite characteristic
- Automatic Sequences
- The Rudin–Shapiro Sequence and Similar Sequences Are Normal Along Squares
- A new complexity function, repetitions in Sturmian words, and irrationality exponents of Sturmian numbers
- Rigidity and Substitutive Dendric Words
- Substitution dynamical systems : algebraic characterization of eigenvalues
- Somme des chiffres et transcendance
- Minimum complexity of automatic non sturmian sequences
- Sur le développement en fraction continue de la série de Baum et Sweet
- ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES
- On multiplicative automatic sequences
- A note on multiplicative automatic sequences, II
- Automorphisms of automatic shifts
- Cobham’s Theorem and Automaticity
- A density version of Cobham’s theorem
- Subword Complexity and k-Synchronization
- AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS
- Automatic continued fractions are transcendental or quadratic
- On the Recognition of Primes by Automata
- Unrecognizable Sets of Numbers
- On the base-dependence of sets of numbers recognizable by finite automata
- Uniform tag sequences
- Classic Set Theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: How to prove that a sequence is not automatic
