EQUIVALENCE BETWEEN AND/OR GRAPHS AND CONTEXT-FREE GRAMMARS

被引:10
作者
HALL, PAV [1 ]
机构
[1] CITY UNIV LONDON,DEPT MATH,LONDON EC1,ENGLAND
关键词
D O I
10.1145/362280.362302
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:444 / 445
页数:2
相关论文
共 4 条
[1]  
Gries D., 1971, COMPILER CONSTRUCTIO
[2]  
Hopcroft J.E., 1969, FORMAL LANGUAGES THE
[3]  
Nilsson N.J., 1971, PROBLEM SOLVING METH
[4]   OPTIMAL SOLUTIONS TO AND/OR SERIES-PARALLEL GRAPHS [J].
SIMON, R ;
LEE, RCT .
JOURNAL OF THE ACM, 1971, 18 (03) :354-&