The following pages link to (Q3912049):
Displaying 4 items.
- Repetitions in strings: algorithms and combinatorics (Q1034529) (← links)
- On cube-free \(\omega\)-words generated by binary morphisms (Q1835915) (← links)
- Some non finitely generated monoids of repetition-free endomorphisms. (Q1853181) (← links)
- If a DOL language is k-power free then it is circular (Q4630287) (← links)
