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  -