Publication:3912049
From MaRDI portal
zbMath0462.68055MaRDI QIDQ3912049
Publication date: 1981
68Q45: Formal languages and automata
Related Items
If a DOL language is k-power free then it is circular, Repetitions in strings: algorithms and combinatorics, On cube-free \(\omega\)-words generated by binary morphisms, Some non finitely generated monoids of repetition-free endomorphisms.