Subject
General Computer Science,Theoretical Computer Science
Reference10 articles.
1. Growth problems for avoidable words;Baker;Theoret. Comput. Sci.,1989
2. Uniformly growing kth powerfree homomorphisms;Brandenburg;Theoret. Comput. Sci.,1983
3. Non-repetitive sequences on three symbols;Brinkhuis;Quart. J. Math. Oxford (2),1983
4. On the number of abelian square-free words on four letters;Carpi;Discrete Appl. Math.,1998
5. J. Cassaigne, Motifs évitables et régularités dans les mots, thèse de doctorat, L.I.T.P., Université Paris 6, 1994.
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献