MEMBERSHIP FOR GROWING CONTEXT-SENSITIVE GRAMMARS IS POLYNOMIAL

被引:69
作者
DAHLHAUS, E
WARMUTH, MK
机构
[1] UNIV CALIF SANTA CRUZ,DEPT COMP & INFORMAT SCI,SANTA CRUZ,CA 95064
[2] HEBREW UNIV JERUSALEM,JERUSALEM,ISRAEL
关键词
D O I
10.1016/0022-0000(86)90062-0
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:456 / 472
页数:17
相关论文
共 25 条
[1]  
Bar-Hillel Yehoshua, 1961, SPRACHTYPOLOGIE UNIV, V14, P143
[2]  
Book R. V., 1971, Journal of Computer and System Sciences, V5, P397, DOI 10.1016/S0022-0000(71)80025-9
[3]  
Book R. V., 1973, International Journal of Computer & Information Sciences, V2, P129, DOI 10.1007/BF00976059
[4]   COMPLEXITY OF FORMAL GRAMMARS [J].
BOOK, RV .
ACTA INFORMATICA, 1978, 9 (02) :171-181
[5]  
Chomsky Noam, 1959, INFORM CONTROL, V2, P137, DOI 10.1016/S0019-9958(59)90362-6
[6]  
COOK SA, 1970, 2ND P ANN ACM S THEO, P70
[7]  
DAHLHAUS E, 1986, LECTURE NOTES COMPUT, V214
[8]  
GAREY MR, COMPUTERS INTRACTABI, P78
[9]  
GLADKII A, 1964, ALGEBRI LOGIKA SEM, V3, P26
[10]   PATTERN SELECTOR GRAMMARS AND SEVERAL PARSING ALGORITHMS IN THE CONTEXT-FREE STYLE [J].
GONCZAROWSKI, J ;
SHAMIR, E .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1985, 30 (03) :249-273