RO  EN
IMI/Publicaţii/CSJM/Ediţii/CSJM v.14, n.3 (42), 2006/

Generating Languages by P Systems with Minimal Symport/Antiport

Authors: Alhazov Artiom, Rogojin Iurie

Abstract

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.

Artiom Alhazov, Yurii Rogozhin,
Institute of Mathematics and Computer Science,
Academy of Sciences of Moldova
5 Academiei str., Chisinau
MD-2028, Moldova
E-mail:
Research Group on Mathematical Linguistics
Rovira i Virgili University, Tarragona, Spain
E-mail:
Dr.hab. Yurii Rogozhin
Institute of Mathematics and Computer Science
Academy of Sciences of Moldova
5 Academiei str., Chisinau,
MD-2028, Moldova
E-mail:

Fulltext

Adobe PDF document0.22 Mb