| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9657762 | Theoretical Computer Science | 2005 | 14 Pages |
Abstract
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:
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Oscar H. Ibarra,