The power of communication: P systems with symport/antiport

被引:231
作者
Paun, A [1 ]
Paun, G
机构
[1] Univ Western Ontario, Dept Comp Sci, London, ON N6A 5B7, Canada
[2] Romanian Acad, Inst Math, Bucharest 70700, Romania
关键词
molecular computing; membrane computing; symport; antiport; computational universality;
D O I
10.1007/BF03037362
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In the attempt to have a framework where the computation is done by communication only, we consider the biological phenomenon of trans-membrane transport of couples of chemicals (one say symport when two chemicals pass together through a membrane, in the same direction, and antiport when two chemicals pass simultaneously through a membrane, in opposite directions). Surprisingly enough, membrane systems without changing (evolving) the used objects and with the communication based on rules of this type are computationally complete, and this result is achieved even for pairs of communicated objects (as encountered in biology). Five membranes are used; the number of membranes is reduced to two if more than two chemicals may collaborate when passing through membranes.
引用
收藏
页码:295 / 305
页数:11
相关论文
共 5 条
[1]  
Alberts B., 1998, ESSENTIAL CELL BIOL
[2]  
Dassow J., 2012, Regulated Rewriting in Formal Language Theory
[3]   Membrane systems with carriers [J].
Martín-Vide, C ;
Pâun, G ;
Rozenberg, G .
THEORETICAL COMPUTER SCIENCE, 2002, 270 (1-2) :779-796
[4]   Computing with membranes [J].
Päun, G .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2000, 61 (01) :108-143
[5]  
ROZENBERG G, 1987, HDB FORMAL LANGUAGES