2010
DOI: 10.1007/978-3-642-11467-0_11
View full text |Buy / Rent full text
|
Sign up to set email alerts
|

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 … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 2 publications
(2 reference statements)
0
2
0
Order By: Relevance
“…We start with the remark that several attempts were done to express the maximally parallel choice of rules using Diophantine equations or ILP. In [2,55] a simple variant of ILP was used (corresponding to the equations (1a) below and variable sum as maximization function). However, in this case only maximally parallel rulesets having a maximal number of rules are obtained.…”
Section: E Reduction To Diophantine Equations and Integer Linear Programmingmentioning
confidence: 99%
“…The same results can be easily obtained using formal powers associated to context-free languages. In this case, the language LN = r p 1 r q 2 | p + q = N is regular and the generation function for LN is q0 = 1/(1 − x) 2 . By expanding q0 to acquire the n-th coefficient we obtain that [x n ]q0 = n + 1, which is the function to compute N BV ariants(Π, C, max) = N + 1.…”
Section: F2 Rule-based Simulationsmentioning
confidence: 99%