|
|
|
Publications in Math-Net.Ru |
Citations |
|
1989 |
| 1. |
Z. R. Dang, “Upper bounds on finite-automaton complexity for generalized regular expressions in a one-letter alphabet”, Diskr. Mat., 1:4 (1989), 12–16    |
|
1974 |
| 2. |
Z. R. Dang, G. S. Tseitin, “An upper estimate of the finite-state complexity for a class of generating schemes containing complements and intersections”, Zap. Nauchn. Sem. LOMI, 40 (1974), 14–23 |
|
1973 |
| 3. |
Z. R. Dang, “On the complexity of a finite automaton corresponding to a generalized regular expression”, Dokl. Akad. Nauk SSSR, 213:1 (1973), 26–29 |
|
Contact us: