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:

Combinatoire de mots récurrents de complexité n+2

Idrissa Kaboré, Théodore Tapsoba

RAIRO-Theor. Inf. Appl., 41 4 (2007) 425-446

Published online: 2007-09-25

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

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

On abelian closures of infinite non-binary words

Juhani Karhumäki, Svetlana Puzynina and Markus A. Whiteland
Discrete Mathematics 347 (9) 114069 (2024)
https://doi.org/10.1016/j.disc.2024.114069

Combinatorics on words obtaining by k to k substitution and k to k exchange of a letter on modulo-recurrent words

Moussa BARRO, K. Ernest BOGNINI and Théodore TAPSOBA
Malaya Journal of Matematik 11 (S) 82 (2023)
https://doi.org/10.26637/mjm11S/006

Abelian combinatorics on words: A survey

Gabriele Fici and Svetlana Puzynina
Computer Science Review 47 100532 (2023)
https://doi.org/10.1016/j.cosrev.2022.100532

Combinatorics on Words

Mélodie Andrieu and Léo Vivion
Lecture Notes in Computer Science, Combinatorics on Words 13899 3 (2023)
https://doi.org/10.1007/978-3-031-33180-0_1

Developments in Language Theory

Juhani Karhumäki, Svetlana Puzynina and Markus A. Whiteland
Lecture Notes in Computer Science, Developments in Language Theory 11088 453 (2018)
https://doi.org/10.1007/978-3-319-98654-8_37