|
MATHEMATICS
On the complexity of a finite automaton corresponding to a generalized regular expression
Z. R. Dang Leningrad State University
Citation:
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
Linking options:
https://www.mathnet.ru/eng/dan37894 https://www.mathnet.ru/eng/dan/v213/i1/p26
|
Statistics & downloads: |
Abstract page: | 92 | Full-text PDF : | 45 |
|