Elementariness of a finite set of words is co-NP-complete
RAIRO-Theor. Inf. Appl., 24 5 (1990) 459-470
Published online: 2017-02-01
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):
Primitive sets of words
Giuseppa Castiglione, Gabriele Fici and Antonio RestivoTheoretical Computer Science 866 25 (2021)
https://doi.org/10.1016/j.tcs.2021.03.003
A two-stage constructive method for the unweighted minimum string cover problem
Manuel Lozano, Francisco J. Rodriguez and Carlos García-MartínezKnowledge-Based Systems 77 103 (2015)
https://doi.org/10.1016/j.knosys.2015.01.003
Computing and Combinatorics
Isabelle Fagnot, Guillaume Fertin and Stéphane VialetteLecture Notes in Computer Science, Computing and Combinatorics 5609 378 (2009)
https://doi.org/10.1007/978-3-642-02882-3_38
Approximation and Online Algorithms
Danny Hermelin, Dror Rawitz, Romeo Rizzi and Stéphane VialetteLecture Notes in Computer Science, Approximation and Online Algorithms 4927 170 (2008)
https://doi.org/10.1007/978-3-540-77918-6_14
The Minimum Substring Cover problem
Danny Hermelin, Dror Rawitz, Romeo Rizzi and Stéphane VialetteInformation and Computation 206 (11) 1303 (2008)
https://doi.org/10.1016/j.ic.2008.06.002
A Linear Time Algorithm that Infers Hidden Strings from Their Concatenations
Tomohiro YasudaIPSJ Transactions on Bioinformatics 1 13 (2008)
https://doi.org/10.2197/ipsjtbio.1.13
Many aspects of defect theorems
Tero Harju and Juhani KarhumäkiTheoretical Computer Science 324 (1) 35 (2004)
https://doi.org/10.1016/j.tcs.2004.03.051
Locally complete sets and finite decomposable codes
Jean Néraud and Carla SelmiTheoretical Computer Science 273 (1-2) 185 (2002)
https://doi.org/10.1016/S0304-3975(00)00440-0
Handbook of Formal Languages
Christian Choffrut and Juhani KarhumäkiHandbook of Formal Languages 329 (1997)
https://doi.org/10.1007/978-3-642-59136-5_6
Word Equations and Related Topics
Jean NeraudLecture Notes in Computer Science, Word Equations and Related Topics 677 187 (1993)
https://doi.org/10.1007/3-540-56730-5_38
Deciding whether a finite set of words has rank at most two
Jean NéraudTheoretical Computer Science 112 (2) 311 (1993)
https://doi.org/10.1016/0304-3975(93)90023-M
On the rank of the subsets of a free monoid
Jean NéraudTheoretical Computer Science 99 (2) 231 (1992)
https://doi.org/10.1016/0304-3975(92)90350-O
A string-matching interpretation of the equation xmyn = zp
J. Néraud and M. CrochemoreTheoretical Computer Science 92 (1) 145 (1992)
https://doi.org/10.1016/0304-3975(92)90140-B
Fundamentals of Computation Theory
Jean NeraudLecture Notes in Computer Science, Fundamentals of Computation Theory 529 360 (1991)
https://doi.org/10.1007/3-540-54458-5_80