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:

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

Combinatorial Algorithms

Francine Blanchet-Sadri, Bob Chen and Aleksandar Chakarov
Lecture Notes in Computer Science, Combinatorial Algorithms 6460 43 (2011)
DOI: 10.1007/978-3-642-19222-7_6
See this article

Testing avoidability on sets of partial words is hard

F. Blanchet-Sadri, Raphaël M. Jungers and Justin Palumbo
Theoretical Computer Science 410 (8-10) 968 (2009)
DOI: 10.1016/j.tcs.2008.11.011
See this article

Number of holes in unavoidable sets of partial words I

F. Blanchet-Sadri, Bob Chen and Aleksandar Chakarov
Journal of Discrete Algorithms 14 55 (2012)
DOI: 10.1016/j.jda.2011.12.001
See this article

Inventories of unavoidable languages and the word-extension conjecture

Laurent Rosaz
Theoretical Computer Science 201 (1-2) 151 (1998)
DOI: 10.1016/S0304-3975(97)00031-5
See this article