PSPACE Limits the Power of P Systems with Active Membranes

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F47813059%3A19240%2F14%3A%230005318" target="_blank" >RIV/47813059:19240/14:#0005318 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

PSPACE Limits the Power of P Systems with Active Membranes

Popis výsledku v původním jazyce

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

Název v anglickém jazyce

PSPACE Limits the Power of P Systems with Active Membranes

Popis výsledku anglicky

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

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/ED1.1.00%2F02.0070" target="_blank" >ED1.1.00/02.0070: Centrum excelence IT4Innovations</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2014

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Journal of Automata, Languages and Combinatorics

ISSN

1430-189X

e-ISSN

—

Svazek periodika

19

Číslo periodika v rámci svazku

1-4

Stát vydavatele periodika

DE - Spolková republika Německo

Počet stran výsledku

14

Strana od-do

291-304

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—