Cited in
(48)- Additive number theory via automata theory
- Decision algorithms for Fibonacci-automatic words. II: Related sequences and avoidability
- Circular critical exponents for Thue-Morse factors
- The Logical Approach to Automatic Sequences
- The undirected repetition threshold and undirected pattern avoidance
- A family of formulas with reversal of high avoidability index
- Some further results on squarefree arithmetic progressions in infinite words
- Say no to case analysis: automating the drudgery of case-based proofs
- On the boundary sequence of an automatic sequence
- scientific article; zbMATH DE number 7069796 (Why is no real title available?)
- Computing the \(k\)-binomial complexity of the Thue-Morse word
- Abelian-square-rich words
- First-order logic and numeration systems
- Synchronized sequences
- Ostrowski-automatic sequences: theory and applications
- Repetitions in infinite palindrome-rich words
- Subword complexity and power avoidance
- Intertwining of complementary Thue-Morse factors
- The periodic complexity function of the Thue-Morse word, the Rudin-Shapiro word, and the period-doubling word
- Grail
- OEIS
- TaPAS
- AutoSquared
- CatalanCC
- DelannoyLS
- MotzkinCC
- EERTREE
- Pecan
- A Frameless 2-Coloring of the Plane Lattice
- The weak circular repetition threshold over large alphabets
- The simplest binary word with only three squares
- Squarefree words with interior disposable factors
- Critical exponents of infinite balanced words
- Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking's conjecture
- When is an automatic set an additive basis?
- Frobenius numbers and automatic sequences
- Congruence properties of combinatorial sequences via walnut and the Rowland-Yassawi-Zeilberger automaton
- Automatic winning shifts
- Properties of a class of Toeplitz words
- Topological invariants for words of linear factor complexity
- Extremal overlap-free and extremal -free binary words
- Prefixes of the Fibonacci word that end with a cube
- Additive Number Theory via Approximation by Regular Languages
- Automaticity and invariant measures of linear cellular automata
- Critical exponent of infinite balanced words via the Pell number system
- Abelian complexity and synchronization
- Deciding game invariance
- Lie complexity of words
This page was built for software: Walnut
