scientific article
From MaRDI portal
Publication:3912049
zbMath0462.68055MaRDI QIDQ3912049
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (4)
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.
This page was built for publication: