Uniformly growing k-th power-free homomorphisms
- 1 March 1988
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 23 (1) , 69-82
- https://doi.org/10.1016/0304-3975(88)90009-6
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- On the subword complexity of square-free DOL languagesTheoretical Computer Science, 1981
- Avoidable patterns in strings of symbolsPacific Journal of Mathematics, 1979
- Sur un théorème de ThueJournal of Combinatorial Theory, Series A, 1972
- The equation $a^M=b^Nc^P$ in a free group.The Michigan Mathematical Journal, 1962