The following pages link to (Q4356052):
Displayed 8 items.
- Automata and differentiable words (Q442244) (← links)
- The complexity of smooth words on 2-letter alphabets (Q653325) (← links)
- A note on the complexity of \(C^{\infty }\)-words (Q708227) (← links)
- Combinatorial properties of smooth infinite words (Q818144) (← links)
- A note on differentiable palindromes. (Q1401323) (← links)
- Palindrome complexity. (Q1853729) (← links)
- Smooth words over arbitrary alphabets (Q2566015) (← links)
- Kolakoski-(2m,2n) are limit-periodic model sets (Q4832919) (← links)