文章基本信息

标题：Generating Languages by P Systems with Minimal Symport/Antiport
本地全文：下载
作者：Alhazov Artiom ; Rogojin Iurie
期刊名称：Computer Science Journal of Moldova
印刷版ISSN：1561-4042
出版年度：2006
卷号：14
期号：3
页码：299-323
出版社：Institute of Mathematics and Computer Science
摘要：It is known that P systems with two membranes and minimal symport/antiport rules are “almost” computationally complete as generators of number or vector sets. Interpreting the result of the computation as the sequence of terminal symbols sent to the environment, we show that P systems with two membranes and symport rules of weight two or symport/antiport rules of weight one generate all recursively enumerable languages.