Geodesic
On the complexity of a finite automaton corresponding to a generalized regular expression
Doklady Akademii Nauk, Tome 213 (1973) no. 1, pp. 26-29.

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

@article{DAN_1973_213_1_a5,
     author = {Z. R. Dang},
     title = {On the complexity of a finite automaton corresponding to a generalized regular expression},
     journal = {Doklady Akademii Nauk},
     pages = {26--29},
     publisher = {mathdoc},
     volume = {213},
     number = {1},
     year = {1973},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DAN_1973_213_1_a5/}
}
TY  - JOUR
AU  - Z. R. Dang
TI  - On the complexity of a finite automaton corresponding to a generalized regular expression
JO  - Doklady Akademii Nauk
PY  - 1973
SP  - 26
EP  - 29
VL  - 213
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DAN_1973_213_1_a5/
LA  - ru
ID  - DAN_1973_213_1_a5
ER  - 
%0 Journal Article
%A Z. R. Dang
%T On the complexity of a finite automaton corresponding to a generalized regular expression
%J Doklady Akademii Nauk
%D 1973
%P 26-29
%V 213
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DAN_1973_213_1_a5/
%G ru
%F DAN_1973_213_1_a5
Z. R. Dang. On the complexity of a finite automaton corresponding to a generalized regular expression. Doklady Akademii Nauk, Tome 213 (1973) no. 1, pp. 26-29. http://geodesic.mathdoc.fr/item/DAN_1973_213_1_a5/