Computing with membranes

被引:1848
作者
Päun, G [1 ]
机构
[1] Romanian Acad, Math Inst, Bucharest 70700, Romania
基金
芬兰科学院;
关键词
membrane structure; P system; recursively enumerable set; matrix grammar; splicing; natural computing;
D O I
10.1006/jcss.1999.1693
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 [计算机科学与技术];
摘要
We introduce a new computability model, of a distributed pal allel type, based on the notion of a membrane structure. Such a structure consists of several cell-like membranes, recurrently placed inside a unique "skin" membrane. A plane representation is a Venn diagram without intersected sets and with a unique superset. In the regions delimited by the membranes there are placed objects. These objects are assumed to evolve: each object can be transformed in other objects, can pass through a membrane, or can dissolve the membrane in which it is placed. A priority relation between evolution rules can be considered. The evolution is done in parallel for all objects able to evolve. In this way, we obtain a computing device (we call it a P system): start with a certain number of objects in a certain membrane and let the system evolve; if it will halt (no object can further evolve), then the computation is finished, with the result given as the number of objects in a specified membrane. If the development of the system goes forever, then the computation fails to have an output. We prove that the P systems with the possibility of objects to cooperate characterize the recursively enumerable sets of natural numbers; moreover, systems with only two membranes suffice. In fact, we do not need cooperating rules, but we only use catalysts, specified objects which are present in the rules but are not modified by the rule application, One catalyst suffices. A variant is also considered, with the objects being strings over a given alphabet. The evolution rules are now based on string transformations. We investigate the case when either the rewriting operation from Chomsky grammars (with respect to context-free productions) or the splicing operation from H systems investigated in the DNA computing is used, In both cases, characterizations of recursively enumerable languages are obtained by very simple P systems: with three membranes in the rewriting case and four in the splicing case. Several open problems and directions for further research an formulated. (C) 2000 Academic Press.
引用
收藏
页码:108 / 143
页数:36
相关论文
共 31 条
[1]
Adleman L. M, 1996, DIMACS SERIES DISCRE, P1, DOI DOI 10.1090/DIMACS/027/01
[2]
AMOS M, 1997, THESIS U WARWICK
[3]
Parallel machine for multiset transformation and its programming style [J].
Banatre, J.-P. ;
Coutant, A. ;
Le Metayer, D. .
Future Generation Computer Systems, 1988, 4 (02) :133-144
[4]
THE CHEMICAL ABSTRACT MACHINE [J].
BERRY, G ;
BOUDOL, G .
THEORETICAL COMPUTER SCIENCE, 1992, 96 (01) :217-248
[5]
Cardelli L, 1998, LECT NOTES COMPUT SC, V1378, P140, DOI 10.1007/BFb0053547
[6]
CARDELLI L, 1999, LECT NOTES COMPUTER, V1603
[7]
Csuhaj-Varju E, 1997, LECT NOTES COMPUT SC, V1218, P299
[8]
Csuhaj-Varju E, 1994, GRAMMAR SYSTEMS GRAM
[9]
CsuhajVarju E, 1996, COMPUT ARTIF INTELL, V15, P419
[10]
CSUHAJVARJU E, 1999, THEORET COMPUT SCI, V215, P348