Enumeration and decidable properties of automatic sequences
From MaRDI portal
Publication:4902892
Recommendations
Cites work
- A decision method for the recognizability of sets defined by number systems
- An Exercise on Fibonacci Representations
- Automatic Sequences
- Bertrand numeration systems and recognizability
- Every real number greater than 1 is a critical exponent
- Handbook of weighted automata
- Least Periods of Factors of Infinite Words
- Lexicographically least words in the orbit closure of the Rudin-Shapiro word
- Noncommutative rational series with applications
- On a Theorem of R. Jungen
- On factors of synchronized sequences
- On synchronized sequences and their separators
- On the factors of automatic words
- On the periodicity of morphic words
- ON THE REPETITIVITY INDEX OF INFINITE WORDS
- ON UNIFORMLY RECURRENT MORPHIC SEQUENCES
- Palindrome complexity.
- Palindromic continued fractions
- Periodicity, repetitions, and orbits of an automatic sequence
- Permutation complexity of the Thue-Morse word
- Reconnaissabilité des substitutions et complexité des suites automatiques
- Separators in infinite words generated by morphisms.
- Squares and overlaps in the Thue-Morse sequence and some variants
- Stern polynomials
- The ring of k-regular sequences
- The ring of \(k\)-regular sequences. II.
- Uniform tag sequences
Cited in
(61)- Pattern spectra, substring enumeration, and automatic sequences
- Morphisms on infinite alphabets, countable states automata and regular sequences
- Additive number theory via automata theory
- Automatic sequences based on Parry or Bertrand numeration systems
- Robustness of Pisot-regular sequences
- Minimal automaton for multiplying and translating the Thue-Morse set
- Revisiting regular sequences in light of rational base numeration systems
- Regular sequences and synchronized sequences in abstract numeration systems
- Decidability and \(k\)-regular sequences
- How to prove that a sequence is not automatic
- Synchronized sequences
- Derived sequences and the factor spectrum of the period-doubling sequence
- Lie complexity of words
- Asymptotic analysis of q-recursive sequences
- Ostrowski-automatic sequences: theory and applications
- On prefix palindromic length of automatic words
- Quasi-universal \(k\)-regular sequences
- A new approach to the 2-regularity of the \(\ell\)-abelian complexity of 2-automatic sequences
- Periodicity, repetitions, and orbits of an automatic sequence
- Abelian-square-rich words
- Computing abelian complexity of binary uniform morphic words
- Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences
- Topological invariants for words of linear factor complexity
- k-automatic sets of rational numbers
- Enumeration and automatic sequences
- Decision algorithms for Fibonacci-automatic words. III: Enumeration and abelian properties.
- Decision algorithms for Fibonacci-automatic words. I: Basic results.
- Effective S-adic symbolic dynamical systems
- A new approach to the paperfolding sequences
- Frobenius numbers and automatic sequences
- Mechanical proofs of properties of the Tribonacci word
- Sequences of Level 1, 2, 3,..., k,...
- scientific article; zbMATH DE number 3918355 (Why is no real title available?)
- scientific article; zbMATH DE number 3933047 (Why is no real title available?)
- scientific article; zbMATH DE number 3948238 (Why is no real title available?)
- scientific article; zbMATH DE number 1972835 (Why is no real title available?)
- When is an automatic set an additive basis?
- First-order logic and numeration systems
- Primitive words and Lyndon words in automatic and linearly recurrent sequences
- Decidability and Enumeration for Automatic Sequences: A Survey
- scientific article; zbMATH DE number 7453075 (Why is no real title available?)
- The simplest binary word with only three squares
- Automatic sequences of rank two
- Topological conjugacy of constant length substitution dynamical systems
- Automaticity and invariant measures of linear cellular automata
- From combinatorial games to shape-symmetric morphisms
- Enumeration and decidable properties of automatic sequences
- Prefix palindromic length of the Thue-Morse word
- scientific article; zbMATH DE number 7089069 (Why is no real title available?)
- On the number of abelian bordered words (with an example of automatic theorem-proving)
- Decimation-invariant sequences and their automaticity
- Bracket words: A generalisation of Sturmian words arising from generalised polynomials
- Automaticity and Parikh-Collinear Morphisms
- Note on a Fibonacci parity sequence
- An Inequality for the Number of Periods in a Word
- The first-order theory of binary overlap-free words is decidable
- On the regularity of the Hankel determinant sequence of the characteristic sequence of powers of 2
- Automatic proofs in combinatorial game theory
- q-Parikh matrices and q-deformed binomial coefficients of words
- Automatic complexity of shift register sequences
- On the permutation complexity of the Cantor-like sequences
This page was built for publication: Enumeration and decidable properties of automatic sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4902892)
