5 search results - page 1 / 1 » Symbol Membrane Complexity of P Systems with Symport Antipor... |
MEMBRANE
2005
Springer
14 years 29 days ago
2005
Springer
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...
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...
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...