![]() |
|
||
|---|---|---|
|
hal-00598215v1
Article dans une revue
Gwenaël Richomme, Francis Wlazinski. Some results on k-power-free morphisms Theoretical Computer Science, Elsevier, 2002, 273, pp.119-142 |
||
|
hal-00015775v1
Article dans une revue
Gwenaël Richomme, Francis Wlazinski. Existence of finite test-sets for k-power-freeness of uniform morphisms Discrete Applied Mathematics, Elsevier, 2007, 155 (15), pp.2001-2016 |
||
|
lirmm-00601553v1
Article dans une revue
Julien Cassaigne, Gwenaël Richomme, Kalle Saari, Luca Q. Zamboni. Avoiding Abelian Powers in Binary Words with Bounded Abelian Complexity International Journal of Foundations of Computer Science, World Scientific Publishing, 2011, 22 (4), pp.905-920. <10.1142/S0129054111008489> |
||
|
||
