PSPACE Limits the Power of P Systems with Active Membranes
Result description
P system with active membranes is probably the most intensively studied model of membrane systems. It was previously shown that many variants of these P systems can solve NP-hard problems in polynomial time, using the strategy of trading space for time.The reverse problem of finding the upper bound of their power was studied, too, and a result showing the upper bound by the complexity class PSPACE was published. In this publication, however, an altered definition of families of P systems was used. An analogous result has not been shown yet for polynomially uniform families of P systems with active membranes under their standard definition, and it was questioned whether such a result holds or not. Here we resolve this open problem positively and we show that the mentioned families of P systems with active membranes can solve, in polynomial time, at most the class of problems PSPACE. Together with other previously known results we can conclude that these families are a member of the Sec
Keywords
The result's identifiers
Result code in IS VaVaI
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
PSPACE Limits the Power of P Systems with Active Membranes
Original language description
P system with active membranes is probably the most intensively studied model of membrane systems. It was previously shown that many variants of these P systems can solve NP-hard problems in polynomial time, using the strategy of trading space for time.The reverse problem of finding the upper bound of their power was studied, too, and a result showing the upper bound by the complexity class PSPACE was published. In this publication, however, an altered definition of families of P systems was used. An analogous result has not been shown yet for polynomially uniform families of P systems with active membranes under their standard definition, and it was questioned whether such a result holds or not. Here we resolve this open problem positively and we show that the mentioned families of P systems with active membranes can solve, in polynomial time, at most the class of problems PSPACE. Together with other previously known results we can conclude that these families are a member of the Sec
Czech name
—
Czech description
—
Classification
Type
Jx - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Journal of Automata, Languages and Combinatorics
ISSN
1430-189X
e-ISSN
—
Volume of the periodical
19
Issue of the periodical within the volume
1-4
Country of publishing house
DE - GERMANY
Number of pages
14
Pages from-to
291-304
UT code for WoS article
—
EID of the result in the Scopus database
—
Result type
Jx - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP
IN - Informatics
Year of implementation
2014