The following pages link to (Q3687735):
Displaying 13 items.
- A powerful abelian square-free substitution over 4 letters (Q837181) (← links)
- The entropy of square-free words (Q967942) (← links)
- A characterization of power-free morphisms (Q1062467) (← links)
- The set of \(k\)-power free words over \(\Sigma\) is empty or perfect (Q1399694) (← links)
- Some results on \(k\)-power-free morphisms (Q1605332) (← links)
- On the structure and extendibility of \(k\)-power free words (Q1891362) (← 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)
- Finitary codes for biinfinite words (Q4020493) (← links)
- On codes with finite interpreting delay: a defect theorem (Q4494481) (← links)
- If a DOL language is k-power free then it is circular (Q4630287) (← links)
- A uniform cube-free morphism is<i>k</i>-power-free for all integers<i>k</i>≥ 4 (Q4638265) (← links)
- Abelian squares are avoidable on 4 letters (Q5204304) (← links)
