P Systems with Randomized Right-hand Sides of Rules
Закрыть
Articolul precedent
Articolul urmator
307 0
SM ISO690:2012
ALHAZOV, Artiom, FREUND, Rudolf, IVANOV, Sergiu. P Systems with Randomized Right-hand Sides of Rules. In: Brainstorming Week On Membrane Computing, 31 ianuarie - 3 februarie 2017, Sevilla. Sevilla, Spania: Sevilla University, 2017, Ediția a 15-a, pp. 13-41. ISBN 978-84-946316-1-0.
EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core
Brainstorming Week On Membrane Computing
Ediția a 15-a, 2017
Masa rotundă "15th Brainstorming Week on Membrane Computing"
Sevilla, Spania, 31 ianuarie - 3 februarie 2017

P Systems with Randomized Right-hand Sides of Rules


Pag. 13-41

Alhazov Artiom12, Freund Rudolf3, Ivanov Sergiu45
 
1 Institute of Mathematics and Computer Science ASM,
2 Huazhong University of Science and Technology,
3 Faculty of Informatics, TU Wien,
4 University of Paris-Est ,
5 Necunoscută, Franţa
 
 
Disponibil în IBN: 14 mai 2021


Rezumat

P systems are a model of hierarchically compartmentalized multiset rewriting. We introduce a novel kind of P systems in which rules are dynamically constructed in each step by non-deterministic pairing of left-hand and right-hand sides. We de ne three variants of right-hand side randomization and compare each of them with the power of conventional P systems. It turns out that all three variants enable non-cooperative P systems to generate exponential (and thus non-semi-linear) number languages. We also give a binary normal form for one of the variants of P systems with randomized rule right-hand sides. Finally, we also discuss extensions of the three variants to tissue P systems, i.e., P systems on an arbitrary graph structure.

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-129804</cfResPublId>
<cfResPublDate>2017</cfResPublDate>
<cfVol>Ediția a 15-a</cfVol>
<cfStartPage>13</cfStartPage>
<cfISBN>978-84-946316-1-0</cfISBN>
<cfURI>https://ibn.idsi.md/ro/vizualizare_articol/129804</cfURI>
<cfTitle cfLangCode='EN' cfTrans='o'>P Systems with Randomized Right-hand Sides of Rules</cfTitle>
<cfAbstr cfLangCode='EN' cfTrans='o'><p>P systems are a model of hierarchically compartmentalized multiset rewriting. We introduce a novel kind of P systems in which rules are dynamically constructed in each step by non-deterministic pairing of left-hand and right-hand sides. We de ne three variants of right-hand side randomization and compare each of them with the power of conventional P systems. It turns out that all three variants enable non-cooperative P systems to generate exponential (and thus non-semi-linear) number languages. We also give a binary normal form for one of the variants of P systems with randomized rule right-hand sides. Finally, we also discuss extensions of the three variants to tissue P systems, i.e., P systems on an arbitrary graph structure.</p></cfAbstr>
<cfResPubl_Class>
<cfClassId>eda2d9e9-34c5-11e1-b86c-0800200c9a66</cfClassId>
<cfClassSchemeId>759af938-34ae-11e1-b86c-0800200c9a66</cfClassSchemeId>
<cfStartDate>2017T24:00:00</cfStartDate>
</cfResPubl_Class>
<cfResPubl_Class>
<cfClassId>e601872f-4b7e-4d88-929f-7df027b226c9</cfClassId>
<cfClassSchemeId>40e90e2f-446d-460a-98e5-5dce57550c48</cfClassSchemeId>
<cfStartDate>2017T24: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>2017T24: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>2017T24: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>2017T24: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>2017T24:00:00</cfStartDate>
<cfFamilyNames>Alhazov</cfFamilyNames>
<cfFirstNames>Artiom</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>2017T24: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>2017T24:00:00</cfStartDate>
<cfFamilyNames>Ivanov</cfFamilyNames>
<cfFirstNames>Sergiu</cfFirstNames>
</cfPersName_Pers>
</cfPers>
</CERIF>