INTRINSICALLY EXPONENTIAL COMPLEXITY OF CIRCULARITY PROBLEM FOR ATTRIBUTE GRAMMARS

被引:48
作者
JAZAYERI, M
OGDEN, WF
ROUNDS, WC
机构
[1] CASE WESTERN, RESERVE UNIV, DEPT COMP SCI, CLEVELAND, OH 44106 USA
[2] UNIV MICHIGAN, DEPT COMP & COMMUN SCI, ANN ARBOR, MI 48104 USA
[3] UNIV N CAROLINA, DEPT COMP SCI, CHAPEL HILL, NC 27514 USA
关键词
D O I
10.1145/361227.361231
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:697 / 706
页数:10
相关论文
共 19 条
[1]  
Aho A.V., 1972, THEORY PARSING TRANS, V1
[2]   TRANSLATIONS ON A CONTEXT FREE GRAMMAR [J].
AHO, AV ;
ULLMAN, JD .
INFORMATION AND CONTROL, 1971, 19 (05) :439-+
[3]  
AHO AV, 1974, DESIGN ANALYSIS COMP
[4]  
BOCHMANN GV, TO BE PUBLISHED
[5]   CHARACTERIZATIONS OF PUSHDOWN MACHINES IN TERMS OF TIME-BOUNDED COMPUTERS [J].
COOK, SA .
JOURNAL OF THE ACM, 1971, 18 (01) :4-&
[6]  
DREISBACH TW, 1972, UCLAENG7289 UCLA COM
[7]  
Hopcroft J.E., 1969, FORMAL LANGUAGES THE
[8]  
JAZAYERI M, 1974, THESIS CASE WESTERN
[9]  
Knuth D. E., 1968, Mathematical Systems Theory, V2, P127, DOI 10.1007/BF01692511
[10]  
Knuth D.E., 1971, MATH SYST THEORY, V5, P95, DOI DOI 10.1007/BF01702865