TY  - JOUR
AU  - Z. R. Dang
TI  - Upper bounds on finite-automaton complexity for generalized regular expressions in a~one-letter alphabet
JO  - Diskretnaya Matematika
PY  - 1989
SP  - 12
EP  - 16
VL  - 1
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_1989_1_4_a1/
LA  - ru
ID  - DM_1989_1_4_a1
ER  -