DOI: 10.1007/978-3-642-11467-0_11
View full text
Oana Agrigoroaiei, Gabriel Ciobanu, Andreas Resios

Abstract: Summary. This paper presents the complexity of finding the multiset of rules in a P system in such a way to have a maximal number of rules applied. It is proved that the decision version of this problem is NP-complete. We study a number of subproblems obtained by considering that a rule can be applied at most once, and by considering the number of objects in the alphabet of the membrane as being fixed. When considering P systems with simple rules, the corresponding decision problem is in P. When considering P…

expand abstract