%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://archive.numdam.org/item/ITA_1990__24_5_459_0/
%G en
%F ITA_1990__24_5_459_0