On the computational completeness of context-free parallel communicating grammar systems

被引：13
|
作者：
Csuhaj-Varjú, E [1 ]
Vaszil, G [1 ]
机构：
[1] Hungarian Acad Sci, Inst Comp & Automat, H-1111 Budapest, Hungary
来源：
THEORETICAL COMPUTER SCIENCE | 1999年 / 215卷 / 1-2期
基金：
匈牙利科学研究基金会;
关键词：
parallel communicating grammar systems; distributed computation; computational completeness;
D O I：
10.1016/S0304-3975(98)00193-5
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We prove that all recursively enumerable languages can be generated by context-free returning parallel communicating grammar systems by showing how the parallel communicating grammars can simulate two-counter machines, a class of Turing machine variants which is known to be computationally complete. Moreover, we prove that systems with a bounded number of components are sufficient to reach this generative power. (C) 1999-Elsevier Science B.V. All rights reserved.
引用
收藏
页码：349 / 358
页数：10
相关论文
共 50 条
12345