Journal of Computer and System Sciences
P systems with active membranes: attacking NP-complete problems
Journal of Automata, Languages and Combinatorics
Grammar Systems: A Grammatical Approach to Distribution and Cooperation
Grammar Systems: A Grammatical Approach to Distribution and Cooperation
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
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
Applications of Membrane Computing (Natural Computing Series)
Applications of Membrane Computing (Natural Computing Series)
P systems without multiplicities of symbol-objects
Information Processing Letters
Asynchronous p systems and p systems working in the sequential mode
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
Membrane computing and brane calculi. Old, new, and future bridges
Theoretical Computer Science
On a Păun's Conjecture in Membrane Systems
IWINAC '07 Proceedings of the 2nd international work-conference on The Interplay Between Natural and Artificial Computation, Part I: Bio-inspired Modeling of Cognitive Tasks
A Multiscale Modeling Framework Based on P Systems
Membrane Computing
Partial Halting and Minimal Parallelism Based on Arbitrary Rule Partitions
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Strategy-Based Proof Calculus for Membrane Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Complexity aspects of polarizationless membrane systems
Natural Computing: an international journal
Partial halting in P systems using membrane rules with permitting contexts
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
A formal framework for static (tissue) P systems
WMC'07 Proceedings of the 8th international conference on Membrane computing
Membrane computing as a modeling framework: cellular systems case studies
SFM'08 Proceedings of the Formal methods for the design of computer, communication, and software systems 8th international conference on Formal methods for computational systems biology
A Notion of Biological Diagnosability Inspired by the Notion of Opacity in Systems Security
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Power and efficiency of minimal parallelism in polarizationless P systems
Journal of Automata, Languages and Combinatorics
(Tissue) P systems working in the k-restricted minimally or maximally parallel transition mode
Natural Computing: an international journal
Asynchronous P systems with active membranes
Theoretical Computer Science
Transition and halting modes in (tissue) p systems
WMC'09 Proceedings of the 10th international conference on Membrane Computing
(Tissue) p systems with hybrid transition modes
WMC'09 Proceedings of the 10th international conference on Membrane Computing
Look-Ahead evolution for p systems
WMC'09 Proceedings of the 10th international conference on Membrane Computing
P systems with active membranes operating under minimal parallelism
CMC'11 Proceedings of the 12th international conference on Membrane Computing
Catalytic petri nets are turing complete
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Partial Halting and Minimal Parallelism Based on Arbitrary Rule Partitions
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Polarizationless P systems with active membranes working in the minimally parallel mode
UC'07 Proceedings of the 6th international conference on Unconventional Computation
A new approach for solving SAT by p systems with active membranes
CMC'12 Proceedings of the 13th international conference on Membrane Computing
On efficient algorithms for SAT
CMC'12 Proceedings of the 13th international conference on Membrane Computing
Hi-index | 5.23 |
A current research topic in membrane computing is to find more realistic P systems from a biological point of view, and one target in this respect is to relax the condition of using the rules in a maximally parallel way. We contribute in this paper to this issue by considering the minimal parallelism of using the rules: if at least a rule from a set of rules associated with a membrane or a region can be used, then at least one rule from that membrane or region must be used, without any other restriction (e.g., more rules can be used, but we do not care how many). Weak as it might look, this minimal parallelism still leads to universality. We first prove this for the case of symport/antiport rules. The result is obtained both for generating and accepting P systems, in the latter case also for systems working deterministically. Then, we consider P systems with active membranes, and again the usual results are obtained: universality and the possibility to solve NP-complete problems in polynomial time (by trading space for time).