Journal of Computer and System Sciences
Membrane Computing: An Introduction
Membrane Computing: An Introduction
The power of communication: P systems with symport/antiport
New Generation Computing
Computationally universal P systems without priorities: two catalysts are sufficient
Theoretical Computer Science - Descriptional complexity of formal systems
On determinism versus nondeterminism in P systems
Theoretical Computer Science
Relationships between nondeterministic and deterministic tape complexities
Journal of Computer and System Sciences
On deterministic catalytic systems
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Expressiveness Issues in Brane Calculi: A Survey
Electronic Notes in Theoretical Computer Science (ENTCS)
Computational power of symport/antiport: history, advances, and open problems
WMC'05 Proceedings of the 6th international conference on Membrane Computing
On the computational power of brane calculi
Transactions on Computational Systems Biology VI
| Hi-index | 0.00 |
We consider P systems that are used as acceptors (recognizers). In the standard semantics of P systems, each evolution step is a result of applying all the rules in a maximally parallel manner: at each step, a maximal multiset of rules are nondeterministically selected and applied in parallel to the current configuration to derive the next configuration (thus, the next configuration is not unique, in general). The system is deterministic if at each step, there is a UNIQUE maximally parallel multiset of rules applicable. The question of whether or not the deterministic version is weaker than the nondeterministic version for various models of P systems is an interesting and fundamental research issue in membrane computing. Here, we look at three popular models of P systems – catalytic systems, symport/antiport systems, and communicating P systems. We report on recent results that answer some open problems in the field. The results are of the following forms: The deterministic version is weaker than the nondeterministic version. The deterministic version is as powerful as the nondeterministic version. The question of whether the deterministic version is weaker than the nondeterministic version is equivalent to the long-standing open problem of whether deterministic linear-bounded automata are weaker than nondeterministic linear-bounded automata.