Pages that link to "Item:Q2974059"
From MaRDI portal
The following pages link to Decision Algorithms for Fibonacci-Automatic Words, III: Enumeration and Abelian Properties (Q2974059):
Displaying 18 items.
- Counting the number of non-zero coefficients in rows of generalized Pascal triangles (Q512556) (← links)
- Ostrowski numeration systems, addition, and finite automata (Q1750300) (← 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)
- Sumsets of Wythoff sequences, Fibonacci representation, and beyond (Q2077894) (← links)
- Ostrowski-automatic sequences: theory and applications (Q2222098) (← links)
- On prefix palindromic length of automatic words (Q2235743) (← links)
- Queens in exile: non-attacking queens on infinite chess boards (Q2309222) (← links)
- Abelian-square-rich words (Q2358695) (← links)
- Critical exponents of infinite balanced words (Q2422043) (← links)
- Robbins and Ardila meet Berstel (Q2656345) (← links)
- The additive structure of integers with the lower Wythoff sequence (Q2700820) (← links)
- Decision algorithms for Fibonacci-automatic Words, I: Basic results (Q3186674) (← links)
- Mechanical Proofs of Properties of the Tribonacci Word (Q3449367) (← links)
- Möbius orthogonality for the Zeckendorf sum-of-digits function (Q4577143) (← links)
- Prefix palindromic length of the Thue-Morse word (Q5212137) (← links)
- Two-dimensional Fibonacci words: tandem repeats and factor complexity (Q6107832) (← links)
- The first-order theory of binary overlap-free words is decidable (Q6622783) (← links)
