Pages that link to "Item:Q799123"
From MaRDI portal
The following pages link to On k-repetition freeness of length uniform morphisms over a binary alphabet (Q799123):
Displayed 6 items.
- There are \(k\)-uniform cubefree binary morphisms for all \(k \geq 0\) (Q967293) (← links)
- Existence of finite test-sets for \(k\)-power-freeness of uniform morphisms (Q2381820) (← links)
- A test-set for<i>k</i>-power-free binary morphisms (Q3149084) (← links)
- Reduction in non-(<i>k</i>+ 1)-power-free morphisms (Q3186671) (← links)
- A uniform cube-free morphism is<i>k</i>-power-free for all integers<i>k</i>≥ 4 (Q4638265) (← links)
- Dyck Words, Pattern Avoidance, and Automatic Sequences (Q6134876) (← links)