14 search results - page 2 / 3 » Computational Completeness of P Systems with Active Membrane... |
SYNASC
2005
IEEE
14 years 1 months ago
2005
IEEE
We improve, by using register machines, some existing universality results for specific models of P systems. P systems with membrane creation are known to generate all recursivel...
MEMBRANE
2004
Springer
14 years 25 days ago
2004
Springer
We proved that two classes of Communicative P systems with 3 membranes and with minimal cooperation, namely P systems with symport/antiport rules of size 1 and and P systems with s...
NGC
2002
Springer
13 years 7 months ago
2002
Springer
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 (o...
CSJM
2006
13 years 7 months ago
2006
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. Interpreti...
JUCS
2002
13 years 7 months ago
2002
: A purely communicative variant of P systems was considered recently, based on the trans-membrane transport of couples of chemicals. When using both symport rules (the chemicals p...