Control Languages Generated by Tissue P Systems with Symport/Antiport Rules
In this work, we investigate the computational completeness of tissue P systems with symport/antiport rules under a recent introduced definition of result, where the result is associated with the sequence of labels of rules used during the computation (called control language). It is proved that one cell suffices to hold computational completeness for tissue P systems with antiport rules of weight at most 2 and no symport rules when two channels are allowed between two cells or between a cell and the environment. If only one channel is allowed between two cells or between a cell and the environment, then tissue P systems consisting of two cells, with antiport rules of weight at most 2 and no symport rules, are proved to be computationally complete.
Membrane computing Tissue P system Completeness Language
Xingyi Zhang Yanjun Liu Bin Luo Linqiang Pan
Key Lab of Intelligent Computing and Signal Processing of Ministry of Education,School of Computer S Key Laboratory of Image Processing and Intelligent Control,Department of Control Science and Enginee
国际会议
成都
英文
203-213
2013-11-04（万方平台首次上网日期，不代表论文的发表时间）