Journal of Computer and System Sciences
Membrane Computing: An Introduction
Membrane Computing: An Introduction
Theoretical Computer Science - Natural computing
The power of communication: P systems with symport/antiport
New Generation Computing
Computing with Membranes
Computationally universal P systems without priorities: two catalysts are sufficient
Theoretical Computer Science - Descriptional complexity of formal systems
Theoretical Computer Science
On the Branching Complexity of P Systems
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
On bounded symport/antiport P systems
DNA'05 Proceedings of the 11th international conference on DNA Computing
Computational power of symport/antiport: history, advances, and open problems
WMC'05 Proceedings of the 6th international conference on Membrane Computing
Some recent results concerning deterministic p systems
WMC'05 Proceedings of the 6th international conference on Membrane Computing
P systems: some recent results and research problems
UPP'04 Proceedings of the 2004 international conference on Unconventional Programming Paradigms
Some computational issues in membrane computing
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
A look back at some early results in membrane computing
WMC'09 Proceedings of the 10th international conference on Membrane Computing
On Restricted Bio-Turing Machines
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
On the Branching Complexity of P Systems
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
| Hi-index | 5.23 |
An important open problem in the area of membrane computing is whether there is a model of P systems for which the nondeterministic version is strictly more powerful than the deterministic version. We resolve this problem in the following sense--we exhibit two classes of P system acceptors with only communicating rules and show: 1. For the first class, the deterministic and nondeterministic versions are equivalent if and only if deterministic and nondeterministic linear bounded automata are equivalent. The latter problem is a long-standing open question in complexity theory. 2. For the second class, the deterministic version is strictly weaker than the nondeterministic version. Both classes are nonuniversal, but can accept fairly complex languages.