PC GRAMMAR SYSTEMS WITH CLUSTERS OF COMPONENTS

被引：0
|
作者：
Csuhaj-Varju, Erzsebet [1 ,2 ]
Oswald, Marion [1 ,3 ]
Vaszil, Gyoergy [1 ]
机构：
[1] Hungarian Acad Sci, Comp & Automat Res Inst, H-1111 Budapest, Hungary
[2] Eotvos Lorand Univ, Dept Algorithms & Their Applicat, Fac Informat, H-1117 Budapest, Hungary
[3] Vienna Univ Technol, Fac Informat, A-1040 Vienna, Austria
来源：
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE | 2011年 / 22卷 / 01期
关键词：
Parallel communicating grammar systems; descriptional complexity; distributed problem solving; clusters of agents;
D O I：
10.1142/S0129054111007952
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We introduce PC grammar systems where the components form clusters and the query symbols refer to clusters not individual grammars, i.e., the addressee of the query is not precisely identified. We prove that if the same component replies to all queries issued to a cluster in a rewriting step, then non-returning PC grammar systems with 3 clusters and 7 context-free components are able to generate any recursively enumerable language. We also provide open problems and directions for future research.
引用
收藏
页码：203 / 212
页数：10
相关论文
共 50 条
12345