On determinism versus nondeterminism in P systems

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: