SOME DECISION-PROBLEMS FOR PARALLEL COMMUNICATING GRAMMAR SYSTEMS

被引：5
|
作者：
TIPLEA, FL
ENE, C
IONESCU, CM
PROCOPIUC, O
机构：
[1] Al.I. Cuza Univ, Iasi, Romania
来源：
THEORETICAL COMPUTER SCIENCE | 1994年 / 134卷 / 02期
关键词：
23;
D O I：
10.1016/0304-3975(94)90243-7
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper we investigate several decision problems for parallel communicating grammar systems: the enabling, circularity, centralizing, conflict-freeness, boundedness, membership, equivalence, inclusion, emptiness and finiteness problems. The first five problems are shown to be decidable for context-free PCS's but undecidable for the context-sensitive case. The last five problems are only studied for the context-sensitive case and they are shown to be undecidable.
引用
收藏
页码：365 / 385
页数：21
相关论文
共 50 条
12345