Membrane Computing: An Introduction
Membrane Computing: An Introduction
The power of communication: P systems with symport/antiport
New Generation Computing
Computation: finite and infinite machines
Computation: finite and infinite machines
On determinism versus nondeterminism in P systems
Theoretical Computer Science
Communicative p systems with minimal cooperation
WMC'04 Proceedings of the 5th international conference on Membrane Computing
Gabor wavelets and General Discriminant Analysis for face identification and verification
Image and Vision Computing
Maximally Parallel Probabilistic Semantics for Multiset Rewriting
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Hi-index | 0.00 |
We consider two complexity parameters related to the graph of reachable configurations of a given P system, namely the outdegree as a measure of the degree of non-determinism, and the indegree as a measure of the degree of confluence. These parameters can be defined for both the generative and the accepting mode of using a P system. We investigate here these parameters in what concerns hierarchies and decidability issues. We prove that all hierarchies have only two levels and that all considered decidability problems have a negative answer.