ON THE SUCCINCTNESS OF DESCRIPTIONS OF CONTEXT-FREE LANGUAGES BY COOPERATING DISTRIBUTED GRAMMAR SYSTEMS

被引:0
|
作者
DASSOW, J [1 ]
PAUN, G [1 ]
机构
[1] UNIV BUCHAREST,FAC MATH,CTR COMP,R-70109 BUCHAREST,ROMANIA
来源
COMPUTERS AND ARTIFICIAL INTELLIGENCE | 1991年 / 10卷 / 06期
关键词
FORMAL GRAMMARS AND LANGUAGES; DESCRIPTIONAL COMPLEXITY; COOPERATION OF GRAMMARS;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We compare the complexities of descriptions of context-free languages by context-free grammars and various types of cooperating/distributed grammar systems. The measures of descriptional complexity are the number of nonterminals, the number of productions, and the total number of symbols in productions.
引用
收藏
页码:513 / 527
页数:15
相关论文
共 50 条