Complexity of simulating R systems by P systems

Alhazov Artiom; Aman Bogdan; Freund Rudolf; Ivanov Sergiu

Articolul precedent

Articolul urmator

388

SM ISO690:2012

ALHAZOV, Artiom, AMAN, Bogdan, FREUND, Rudolf, IVANOV, Sergiu. Complexity of simulating R systems by P systems. In: Brainstorming Week on Membrane Computing, 1-5 februarie 2016, Sevilla. Sevilla, Spania: Universidad de Sevilla, 2016, Ediția a 14-a, pp. 1-14.

EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core

Brainstorming Week on Membrane Computing
Ediția a 14-a, 2016

Masa rotundă "14th Brainstorming Week on Membrane Computing"
Sevilla, Spania, 1-5 februarie 2016

Complexity of simulating R systems by P systems

Pag. 1-14

Alhazov Artiom¹, Aman Bogdan², Freund Rudolf³, Ivanov Sergiu⁴

¹ Institute of Mathematics and Computer Science ASM,
² Institute for Computer Science, Romanian Academy, Iasi Branch,
³ Faculty of Informatics, TU Wien,
⁴ University of Paris-Est

Disponibil în IBN: 8 mai 2021

Descarcă PDF

Rezumat

We show multiple ways to simulate R systems by non-cooperative P systems with atomic control by promoters and/or inhibitors, or with matter-antimatter annihilation rules, with a slowdown by a factor of constant. The descriptional complexity is also linear with respect to that of simulated R system. All these constants depend on how general the model of R systems is, as well as on the chosen control ingredients of P systems. Special attention is paid to the di erences in the mode of rule application in these models.

Cerif XML Export

<?xml version='1.0' encoding='utf-8'?>
<CERIF xmlns='urn:xmlns:org:eurocris:cerif-1.5-1' xsi:schemaLocation='urn:xmlns:org:eurocris:cerif-1.5-1 http://www.eurocris.org/Uploads/Web%20pages/CERIF-1.5/CERIF_1.5_1.xsd' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' release='1.5' date='2012-10-07' sourceDatabase='Output Profile'>
<cfResPubl>
<cfResPublId>ibn-ResPubl-129259</cfResPublId>
<cfResPublDate>2016</cfResPublDate>
<cfVol>Ediția a 14-a</cfVol>
<cfStartPage>1</cfStartPage>
<cfISBN></cfISBN>
<cfURI>https://ibn.idsi.md/ro/vizualizare_articol/129259</cfURI>
<cfTitle cfLangCode='EN' cfTrans='o'>Complexity of simulating R systems by P systems</cfTitle>
<cfAbstr cfLangCode='EN' cfTrans='o'><p>We show multiple ways to simulate R systems by non-cooperative P systems with atomic control by promoters and/or inhibitors, or with matter-antimatter annihilation rules, with a slowdown by a factor of constant. The descriptional complexity is also linear with respect to that of simulated R system. All these constants depend on how general the model of R systems is, as well as on the chosen control ingredients of P systems. Special attention is paid to the di erences in the mode of rule application in these models.</p></cfAbstr>
<cfResPubl_Class>
<cfClassId>eda2d9e9-34c5-11e1-b86c-0800200c9a66</cfClassId>
<cfClassSchemeId>759af938-34ae-11e1-b86c-0800200c9a66</cfClassSchemeId>
<cfStartDate>2016T24:00:00</cfStartDate>
</cfResPubl_Class>
<cfResPubl_Class>
<cfClassId>e601872f-4b7e-4d88-929f-7df027b226c9</cfClassId>
<cfClassSchemeId>40e90e2f-446d-460a-98e5-5dce57550c48</cfClassSchemeId>
<cfStartDate>2016T24:00:00</cfStartDate>
</cfResPubl_Class>
<cfPers_ResPubl>
<cfPersId>ibn-person-13033</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2016T24:00:00</cfStartDate>
</cfPers_ResPubl>
<cfPers_ResPubl>
<cfPersId>ibn-person-46102</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2016T24:00:00</cfStartDate>
</cfPers_ResPubl>
<cfPers_ResPubl>
<cfPersId>ibn-person-22100</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2016T24:00:00</cfStartDate>
</cfPers_ResPubl>
<cfPers_ResPubl>
<cfPersId>ibn-person-20300</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2016T24:00:00</cfStartDate>
</cfPers_ResPubl>
</cfResPubl>
<cfPers>
<cfPersId>ibn-Pers-13033</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-13033-3</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2016T24:00:00</cfStartDate>
<cfFamilyNames>Alhazov</cfFamilyNames>
<cfFirstNames>Artiom</cfFirstNames>
</cfPersName_Pers>
</cfPers>
<cfPers>
<cfPersId>ibn-Pers-46102</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-46102-3</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2016T24:00:00</cfStartDate>
<cfFamilyNames>Aman</cfFamilyNames>
<cfFirstNames>Bogdan</cfFirstNames>
</cfPersName_Pers>
</cfPers>
<cfPers>
<cfPersId>ibn-Pers-22100</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-22100-3</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2016T24:00:00</cfStartDate>
<cfFamilyNames>Freund</cfFamilyNames>
<cfFirstNames>Rudolf</cfFirstNames>
</cfPersName_Pers>
</cfPers>
<cfPers>
<cfPersId>ibn-Pers-20300</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-20300-3</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2016T24:00:00</cfStartDate>
<cfFamilyNames>Ivanov</cfFamilyNames>
<cfFirstNames>Sergiu</cfFirstNames>
</cfPersName_Pers>
</cfPers>
</CERIF>