Pages that link to "Item:Q5093875"
From MaRDI portal
The following pages link to The Logical Approach to Automatic Sequences (Q5093875):
Displaying 13 items.
- (Q5883504) (← links)
- Abelian combinatorics on words: a survey (Q6101322) (← links)
- Decidable problems in substitution shifts (Q6126479) (← links)
- Note on a Fibonacci parity sequence (Q6159442) (← links)
- Values of binary partition function represented by a sum of three squares (Q6171692) (← links)
- Characterizations of families of morphisms and words via binomial complexities (Q6201915) (← links)
- A General Approach to Proving Properties of Fibonacci Representations via Automata Theory (Q6204138) (← links)
- Dyck words, pattern avoidance, and automatic sequences (Q6615627) (← links)
- Consecutive power occurrences in Sturmian words (Q6633616) (← links)
- Extending Dekking's construction of an infinite binary word avoiding abelian 4-powers (Q6654113) (← links)
- String attractors of some simple-parry automatic sequences (Q6661762) (← links)
- Automatic abelian complexities of Parikh-collinear fixed points (Q6661763) (← links)
- Using finite automata to compute the base-\(b\) representation of the golden ratio and other quadratic irrationals (Q6666784) (← links)