Pages that link to "Item:Q4928472"
From MaRDI portal
The following pages link to Decidability and Enumeration for Automatic Sequences: A Survey (Q4928472):
Displayed 10 items.
- Some properties of a Rudin-Shapiro-like sequence (Q477769) (← links)
- Additive number theory via automata theory (Q1987517) (← links)
- Ostrowski-automatic sequences: theory and applications (Q2222098) (← links)
- Abelian-square-rich words (Q2358695) (← links)
- Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences (Q2635089) (← links)
- Decision algorithms for Fibonacci-automatic Words, I: Basic results (Q3186674) (← links)
- Effective S-adic Symbolic Dynamical Systems (Q3188236) (← links)
- Mechanical Proofs of Properties of the Tribonacci Word (Q3449367) (← links)
- First-Order Logic and Numeration Systems (Q4613547) (← links)
- Complexity of automatic sequences (Q5918530) (← links)