Geodesic
The complexity of enumerating a finite set of words
Doklady Akademii Nauk, Tome 228 (1976) no. 2, pp. 287-289.

Voir la notice de l'article provenant de la source Math-Net.Ru

@article{DAN_1976_228_2_a6,
     author = {R. E. Krichevskii},
     title = {The complexity of enumerating a finite set of words},
     journal = {Doklady Akademii Nauk},
     pages = {287--289},
     publisher = {mathdoc},
     volume = {228},
     number = {2},
     year = {1976},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DAN_1976_228_2_a6/}
}
TY  - JOUR
AU  - R. E. Krichevskii
TI  - The complexity of enumerating a finite set of words
JO  - Doklady Akademii Nauk
PY  - 1976
SP  - 287
EP  - 289
VL  - 228
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DAN_1976_228_2_a6/
LA  - ru
ID  - DAN_1976_228_2_a6
ER  - 
%0 Journal Article
%A R. E. Krichevskii
%T The complexity of enumerating a finite set of words
%J Doklady Akademii Nauk
%D 1976
%P 287-289
%V 228
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DAN_1976_228_2_a6/
%G ru
%F DAN_1976_228_2_a6
R. E. Krichevskii. The complexity of enumerating a finite set of words. Doklady Akademii Nauk, Tome 228 (1976) no. 2, pp. 287-289. http://geodesic.mathdoc.fr/item/DAN_1976_228_2_a6/