Geodesic
Elementariness of a finite set of words is co-NP-complete
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 24 (1990) no. 5, pp. 459-470

Voir la notice de l'article provenant de la source Numdam

@article{ITA_1990__24_5_459_0,
     author = {Neraud, Jean},
     title = {Elementariness of a finite set of words is {co-NP-complete}},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {459--470},
     publisher = {EDP-Sciences},
     volume = {24},
     number = {5},
     year = {1990},
     mrnumber = {1080501},
     zbl = {0704.68065},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/ITA_1990__24_5_459_0/}
}
TY  - JOUR
AU  - Neraud, Jean
TI  - Elementariness of a finite set of words is co-NP-complete
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1990
SP  - 459
EP  - 470
VL  - 24
IS  - 5
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/item/ITA_1990__24_5_459_0/
LA  - en
ID  - ITA_1990__24_5_459_0
ER  - 
%0 Journal Article
%A Neraud, Jean
%T Elementariness of a finite set of words is co-NP-complete
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1990
%P 459-470
%V 24
%N 5
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/item/ITA_1990__24_5_459_0/
%G en
%F ITA_1990__24_5_459_0
Neraud, Jean. Elementariness of a finite set of words is co-NP-complete. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 24 (1990) no. 5, pp. 459-470. http://geodesic.mathdoc.fr/item/ITA_1990__24_5_459_0/