Pages that link to "Item:Q5300845"
From MaRDI portal
The following pages link to Subword Complexity and k-Synchronization (Q5300845):
Displaying 12 items.
- Counting the number of non-zero coefficients in rows of generalized Pascal triangles (Q512556) (← links)
- Additive number theory via automata theory (Q1987517) (← links)
- How to prove that a sequence is not automatic (Q2121041) (← links)
- Synchronized sequences (Q2140455) (← links)
- Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences (Q2635089) (← links)
- Decision Algorithms for Fibonacci-Automatic Words, III: Enumeration and Abelian Properties (Q2974059) (← links)
- Mechanical Proofs of Properties of the Tribonacci Word (Q3449367) (← links)
- General Framework (Q4613545) (← links)
- First-Order Logic and Numeration Systems (Q4613547) (← links)
- Abelian Complexity and Synchronization (Q4987418) (← links)
- Automatic sequences of rank two (Q5044415) (← links)
- Dyck Words, Pattern Avoidance, and Automatic Sequences (Q6134876) (← links)