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:

Elementariness of a finite set of words is co-NP-complete

Jean Neraud

RAIRO-Theor. Inf. Appl., 24 5 (1990) 459-470

Published online: 2017-02-01

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

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

Many aspects of defect theorems

Tero Harju and Juhani Karhumäki
Theoretical Computer Science 324 (1) 35 (2004)
DOI: 10.1016/j.tcs.2004.03.051
See this article

A string-matching interpretation of the equation xmyn = zp

J. Néraud and M. Crochemore
Theoretical Computer Science 92 (1) 145 (1992)
DOI: 10.1016/0304-3975(92)90140-B
See this article

Locally complete sets and finite decomposable codes

Jean Néraud and Carla Selmi
Theoretical Computer Science 273 (1-2) 185 (2002)
DOI: 10.1016/S0304-3975(00)00440-0
See this article

A Linear Time Algorithm that Infers Hidden Strings from Their Concatenations

Tomohiro Yasuda
IPSJ Transactions on Bioinformatics 1 13 (2008)
DOI: 10.2197/ipsjtbio.1.13
See this article

Danny Hermelin, Dror Rawitz, Romeo Rizzi and Stéphane Vialette
4927 170 (2008)
DOI: 10.1007/978-3-540-77918-6_14
See this article

Jean Neraud
529 360 (1991)
DOI: 10.1007/3-540-54458-5_80
See this article

On the rank of the subsets of a free monoid

Jean Néraud
Theoretical Computer Science 99 (2) 231 (1992)
DOI: 10.1016/0304-3975(92)90350-O
See this article

A two-stage constructive method for the unweighted minimum string cover problem

Manuel Lozano, Francisco J. Rodriguez and Carlos García-Martínez
Knowledge-Based Systems 77 103 (2015)
DOI: 10.1016/j.knosys.2015.01.003
See this article

Jean Neraud
677 187 (1993)
DOI: 10.1007/3-540-56730-5_38
See this article

Deciding whether a finite set of words has rank at most two

Jean Néraud
Theoretical Computer Science 112 (2) 311 (1993)
DOI: 10.1016/0304-3975(93)90023-M
See this article

Christian Choffrut and Juhani Karhumäki
329 (1997)
DOI: 10.1007/978-3-642-59136-5_6
See this article

Isabelle Fagnot, Guillaume Fertin and Stéphane Vialette
5609 378 (2009)
DOI: 10.1007/978-3-642-02882-3_38
See this article

Primitive sets of words

Giuseppa Castiglione, Gabriele Fici and Antonio Restivo
Theoretical Computer Science 866 25 (2021)
DOI: 10.1016/j.tcs.2021.03.003
See this article

The Minimum Substring Cover problem

Danny Hermelin, Dror Rawitz, Romeo Rizzi and Stéphane Vialette
Information and Computation 206 (11) 1303 (2008)
DOI: 10.1016/j.ic.2008.06.002
See this article