Articolul precedent |
Articolul urmator |
292 0 |
SM ISO690:2012 ALHAZOV, Artiom, FREUND, Rudolf, IVANOV, Sergiu. Hierarchical P systems with randomized right-hand sides of rules. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Ed. 18, 24-28 iulie 2017, Bradford. Dusseldorf, Germania: Springer Verlag, 2018, Vol. 10725, pp. 15-39. ISBN 978-331973358-6. ISSN 03029743. DOI: https://doi.org/10.1007/978-3-319-73359-3_2 |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 10725, 2018 |
|
Sesiunea "18th International Conference on Membrane Computing" 18, Bradford, Marea Britanie, 24-28 iulie 2017 | |
|
|
DOI:https://doi.org/10.1007/978-3-319-73359-3_2 | |
Pag. 15-39 | |
Vezi articolul | |
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 define 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. |
|
Cuvinte-cheie Multiset rewriting, Non-cooperative P systems, normal form, P systems, Randomized rules, Right-hand sides |
|
|
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-135593</cfResPublId> <cfResPublDate>2018</cfResPublDate> <cfVol>Vol. 10725</cfVol> <cfStartPage>15</cfStartPage> <cfISBN>978-331973358-6</cfISBN> <cfURI>https://ibn.idsi.md/ro/vizualizare_articol/135593</cfURI> <cfTitle cfLangCode='EN' cfTrans='o'>Hierarchical P systems with randomized right-hand sides of rules</cfTitle> <cfKeyw cfLangCode='EN' cfTrans='o'>Multiset rewriting; Non-cooperative P systems; normal form; P systems; Randomized rules; Right-hand sides</cfKeyw> <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 define 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. </p></cfAbstr> <cfResPubl_Class> <cfClassId>eda2d9e9-34c5-11e1-b86c-0800200c9a66</cfClassId> <cfClassSchemeId>759af938-34ae-11e1-b86c-0800200c9a66</cfClassSchemeId> <cfStartDate>2018T24:00:00</cfStartDate> </cfResPubl_Class> <cfResPubl_Class> <cfClassId>e601872f-4b7e-4d88-929f-7df027b226c9</cfClassId> <cfClassSchemeId>40e90e2f-446d-460a-98e5-5dce57550c48</cfClassSchemeId> <cfStartDate>2018T24: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>2018T24: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>2018T24: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>2018T24: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>2018T24: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>2018T24: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>2018T24:00:00</cfStartDate> <cfFamilyNames>Ivanov</cfFamilyNames> <cfFirstNames>Sergiu</cfFirstNames> </cfPersName_Pers> </cfPers> </CERIF>