On cube-free ω-words generated by binary morphisms
- 1 March 1983
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 5 (3), 279-297
- https://doi.org/10.1016/0166-218x(83)90002-1
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- On the subword complexity of square-free DOL languagesTheoretical Computer Science, 1981
- On strongly cube-free ω-words generated by binary morphismsLecture Notes in Computer Science, 1981
- Mots sans carre et morphismes iteresDiscrete Mathematics, 1980
- Avoidable patterns in strings of symbolsPacific Journal of Mathematics, 1979
- Sur les mots sans carré définis par un morphismeLecture Notes in Computer Science, 1979
- Sur un théorème de ThueJournal of Combinatorial Theory, Series A, 1972