Articles citing this article

The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).

Cited article:

A test-set for k-power-free binary morphisms

F. Wlazinski

RAIRO-Theor. Inf. Appl., 35 5 (2001) 437-452

Published online: 2002-08-15

DOI: https://doi.org/10.1051/ita:2001104

This article has been cited by the following article(s):

Power-free complementary binary morphisms

Jeffrey Shallit, Arseny Shur and Stefan Zorcic
Journal of Combinatorial Theory, Series A 207 105910 (2024)
https://doi.org/10.1016/j.jcta.2024.105910

Existence of finite test-sets for k-power-freeness of uniform morphisms

G. Richomme and F. Wlazinski
Discrete Applied Mathematics 155 (15) 2001 (2007)
https://doi.org/10.1016/j.dam.2007.04.024

Overlap-free morphisms and finite test-sets

G. Richomme and F. Wlazinski
Discrete Applied Mathematics 143 (1-3) 92 (2004)
https://doi.org/10.1016/j.dam.2003.10.005

CONJECTURES AND RESULTS ON MORPHISMS GENERATING k-POWER-FREE WORDS

GWÉNAËL RICHOMME and PATRICE SÉÉBOLD
International Journal of Foundations of Computer Science 15 (02) 307 (2004)
https://doi.org/10.1142/S0129054104002431

Mathematical Foundations of Computer Science 2002

Gwenael Richomme and Francis Wlazinski
Lecture Notes in Computer Science, Mathematical Foundations of Computer Science 2002 2420 605 (2002)
https://doi.org/10.1007/3-540-45687-2_50