The following pages link to (Q3926698):
Displayed 11 items.
- Automata and differentiable words (Q442244) (← links)
- Vertical representation of \(\mathbf{C}^\infty\)-words (Q482290) (← 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)
- On the number of \(C^{\infty}\)-words of each length (Q1121320) (← links)
- On repeated factors in \(C^\infty\)-words (Q1342256) (← links)
- A note on differentiable palindromes. (Q1401323) (← links)
- Smooth words on 2-letter alphabets having same parity (Q2481962) (← links)
- Smooth words over arbitrary alphabets (Q2566015) (← links)
- Iterative devices generating infinite words (Q5096808) (← links)