%0 Journal Article
%A Z. R. Dang
%T Upper bounds on finite-automaton complexity for generalized regular expressions in a~one-letter alphabet
%J Diskretnaya Matematika
%D 1989
%P 12-16
%V 1
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_1989_1_4_a1/
%G ru
%F DM_1989_1_4_a1