The Logical Approach to Automatic Sequences
From MaRDI portal
Recommendations
Cited in
(51)- The periodic complexity function of the Thue-Morse word, the Rudin-Shapiro word, and the period-doubling word
- Abelian combinatorics on words: a survey
- On extended boundary sequences of morphic and Sturmian words
- Proving results about OEIS sequences with \texttt{Walnut}
- Decidable problems in substitution shifts
- String Attractors of Fixed Points of k-Bonacci-Like Morphisms
- Dyck Words, Pattern Avoidance, and Automatic Sequences
- Rudin-Shapiro Sums via Automata Theory and Logic
- Automaticity and Parikh-Collinear Morphisms
- Proving properties of some greedily-defined Integer recurrences via automata theory
- Note on a Fibonacci parity sequence
- Values of binary partition function represented by a sum of three squares
- Transduction of automatic sequences and applications
- Characterizations of families of morphisms and words via binomial complexities
- A General Approach to Proving Properties of Fibonacci Representations via Automata Theory
- Dyck words, pattern avoidance, and automatic sequences
- Consecutive power occurrences in Sturmian words
- Extending Dekking's construction of an infinite binary word avoiding abelian 4-powers
- String attractors of some simple-parry automatic sequences
- Automatic abelian complexities of Parikh-collinear fixed points
- Using finite automata to compute the base-b representation of the golden ratio and other quadratic irrationals
- Computing the base-\(b\) representation of quadratic irrationals using automata
- Variants of Wythoff game with terminal positions or blocking maneuvers
- A self-generating sequence
- Self-verifying predicates in Büchi arithmetic
- On Cloitre's hiccup sequences
- Integer linear-exponential programming in NP by quantifier elimination
- Words avoiding half-flips
- Avoiding abelian and additive powers in rich words
- The reflection complexity of sequences over finite alphabets
- Automatic proofs in combinatorial game theory
- Using \texttt{Walnut} to solve problems from the OEIS
- Proof of Irvine's conjecture via mechanized guessing
- Monochromatic arithmetic progressions in the Fibonacci, Thue-Morse, and Rudin-Shapiro words
- Combinatorics on words and generating Dirichlet series of automatic sequences
- Repetition factorization of automatic sequences
- q-Parikh matrices and q-deformed binomial coefficients of words
- Rudin-Shapiro sums via automata theory and logic
- Constructing morphisms for arithmetic subsequences of Fibonacci
- Existential definability of unary predicates in Büchi arithmetic
- Automated reasoning for mathematics
- Prefixes of the Fibonacci word
- Runs in paperfolding sequences
- An introduction to the theory of linear integer arithmetic (invited paper)
- Additive word complexity and \texttt{Walnut}
- Beatty sequences for a quadratic irrational: decidability and applications
- On palindromic periodicities
- Words with factor complexity 2n+1 and minimal critical exponent
- Complexity of linear subsequences of Fibonacci-automatic sequences
- On a sequence of Kimberling and its relationship to the tribonacci word
- Balanced Fibonacci word rectangles, and beyond
This page was built for publication: The Logical Approach to Automatic Sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5093875)
