Sciweavers

5 search results - page 1 / 1
» Symbol Membrane Complexity of P Systems with Symport Antipor...
Sort
View
MEMBRANE
2005
Springer
13 years 10 months ago
Symbol/Membrane Complexity of P Systems with Symport/Antiport Rules
Artiom Alhazov, Rudolf Freund, Marion Oswald
CSJM
2006
79views more  CSJM 2006»
13 years 5 months ago
Generating Languages by P Systems with Minimal Symport/Antiport
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...
Artiom Alhazov, Yurii Rogozhin
JUCS
2002
80views more  JUCS 2002»
13 years 4 months ago
On the Power of P Systems with Symport Rules
: 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...
Carlos Martín-Vide, Andrei Paun, Gheorghe P...
NGC
2002
Springer
111views Communications» more  NGC 2002»
13 years 4 months ago
The Power of Communication: P Systems with Symport/Antiport
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...
Andrei Paun, Gheorghe Paun
SYNASC
2005
IEEE
86views Algorithms» more  SYNASC 2005»
13 years 10 months ago
One and Two Polarizations, Membrane Creation and Objects Complexity in P Systems
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...
Artiom Alhazov, Rudolf Freund, Agustin Riscos-N&ua...