The following pages link to Walnut (Q41836):
Displayed 39 items.
- Decision algorithms for Fibonacci-automatic words. II: Related sequences and avoidability (Q346252) (← links)
- Deciding game invariance (Q515578) (← links)
- Additive number theory via automata theory (Q1987517) (← links)
- Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking's conjecture (Q2020439) (← links)
- Say no to case analysis: automating the drudgery of case-based proofs (Q2117657) (← links)
- Synchronized sequences (Q2140455) (← links)
- Lie complexity of words (Q2163386) (← links)
- Congruence properties of combinatorial sequences via walnut and the Rowland-Yassawi-Zeilberger automaton (Q2170788) (← links)
- Extremal overlap-free and extremal \(\beta\)-free binary words (Q2215463) (← links)
- Ostrowski-automatic sequences: theory and applications (Q2222098) (← links)
- On the boundary sequence of an automatic sequence (Q2237216) (← links)
- Subword complexity and power avoidance (Q2326389) (← links)
- Critical exponent of infinite balanced words via the Pell number system (Q2333033) (← links)
- Repetitions in infinite palindrome-rich words (Q2333034) (← links)
- Some further results on squarefree arithmetic progressions in infinite words (Q2333815) (← links)
- Abelian-square-rich words (Q2358695) (← links)
- Critical exponents of infinite balanced words (Q2422043) (← links)
- Squarefree words with interior disposable factors (Q2658049) (← links)
- The undirected repetition threshold and undirected pattern avoidance (Q2662683) (← links)
- Automatic winning shifts (Q2672264) (← links)
- Properties of a class of Toeplitz words (Q2672565) (← links)
- Topological invariants for words of linear factor complexity (Q2672961) (← links)
- Prefixes of the Fibonacci word that end with a cube (Q2681077) (← links)
- Frobenius Numbers and Automatic Sequences (Q3390106) (← links)
- When is an automatic set an additive basis? (Q4577830) (← links)
- First-Order Logic and Numeration Systems (Q4613547) (← links)
- Abelian Complexity and Synchronization (Q4987418) (← links)
- A Frameless 2-Coloring of the Plane Lattice (Q5019913) (← links)
- The weak circular repetition threshold over large alphabets (Q5021102) (← links)
- The simplest binary word with only three squares (Q5021107) (← links)
- (Q5042381) (← links)
- The Logical Approach to Automatic Sequences (Q5093875) (← links)
- Automaticity and Invariant Measures of Linear Cellular Automata (Q5138775) (← links)
- Circular critical exponents for Thue–Morse factors (Q5223830) (← links)
- A family of formulas with reversal of high avoidability index (Q5365323) (← links)
- (Q5384332) (← links)
- Additive Number Theory via Approximation by Regular Languages (Q5859643) (← links)
- (Q5883504) (← links)
- Computing the \(k\)-binomial complexity of the Thue-Morse word (Q5918904) (← links)
