Handbook of Formal Languages
Membrane Computing: An Introduction
Membrane Computing: An Introduction
About P systems with symport/antiport
Soft Computing - A Fusion of Foundations, Methodologies and Applications
P systems with minimal parallelism
Theoretical Computer Science
Generalized communicating P systems
Theoretical Computer Science
A formal framework for static (tissue) P systems
WMC'07 Proceedings of the 8th international conference on Membrane computing
Computational completeness of tissue p systems with conditional uniport
WMC'06 Proceedings of the 7th international conference on Membrane Computing
WMC'04 Proceedings of the 5th international conference on Membrane Computing
Implementation of catalytic p systems
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Properties of membrane systems
CMC'11 Proceedings of the 12th international conference on Membrane Computing
| Hi-index | 0.00 |
This article introduces a new derivation mode for P systems. This mode permits to evaluate next possible configurations and to discard some of them according to forbidding conditions. The interesting point is that the software implementation of this mode needs very small modifications to the standard algorithm of rule assignment for maximal parallelism. The introduced mode has numerous advantages with respect to the maximally parallel mode, the most important one being that some non-deterministic proofs become deterministic. As an example we present a generalized communicating P system that accepts 2n in n steps in a deterministic way. Another example shows that in the deterministic case this mode is strictly more powerful than the maximally parallel derivation mode. Finally, this mode gives a natural way to define P systems that may accept or reject a computation.