Tissue-like P Systems with Channel-States
Tissue-like P Systems with Channel-States
复制标题
DOI：
--
复制
发表时间：
2004
期刊：
影响因子：
--
通讯作者：
R. Freund;G. Paun;M. J. P. Jiménez
中科院分区：
文献类型：
--
作者：
R. Freund;G. Paun;M. J. P. Jiménez
我们考虑类组织P系统，其状态与细胞之间的链接（我们称之为突触）相关，控制对象通过链接。我们调查的计算能力，这样的设备的情况下使用-在一个连续的方式-小权重的反端口规则。证明了具有两个单元的系统在具有任意多个状态和最小反向规则，或两个状态和反向规则的权重为2时是普适的。具有任意多个胞腔、三个状态和最小反向规则的系统也是普适的。相比之下，系统与一个细胞和任何数量的状态和规则的任何重量只计算Parikh集的矩阵语言（生成的矩阵文法没有外观检查）;矩阵语言的Parikh图像的特征得到这样的单细胞系统与反端口规则的重量减少。一系列的开放性问题也制定。
We consider tissue-like P systems with states associated with the links (we call them synapses) between cells, controlling the passage of objects across the links. We investigate the computing power of such devices for the case of using – in a sequential manner – antiport rules of small weights. Systems with two cells are proven to be universal when having arbitrarily many states and minimal antiport rules, or two states, and antiport rules of weight two. Also the systems with arbitrarily many cells, three states, and minimal antiport rules are universal. In contrast, the systems with one cell and any number of states and rules of any weight only compute Parikh sets of matrix languages (generated by matrix grammars without appearance checking); characterizations of Parikh images of matrix languages are obtained for such one-cell systems with antiport rules of a reduced weight. A series of open problems are also formulated.