Articolul precedent |
Articolul urmator |
334 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 |
|
|
DataCite XML Export
<?xml version='1.0' encoding='utf-8'?> <resource xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xmlns='http://datacite.org/schema/kernel-3' xsi:schemaLocation='http://datacite.org/schema/kernel-3 http://schema.datacite.org/meta/kernel-3/metadata.xsd'> <creators> <creator> <creatorName>Alhazov, A.E.</creatorName> <affiliation>Institutul de Matematică şi Informatică "Vladimir Andrunachievici", Moldova, Republica</affiliation> </creator> <creator> <creatorName>Freund, R.</creatorName> <affiliation>Technical University of Vienna, Austria</affiliation> </creator> <creator> <creatorName>Ivanov, S.V.</creatorName> <affiliation>Université Paris-Est-Créteil, Franţa</affiliation> </creator> </creators> <titles> <title xml:lang='en'>Hierarchical P systems with randomized right-hand sides of rules</title> </titles> <publisher>Instrumentul Bibliometric National</publisher> <publicationYear>2018</publicationYear> <relatedIdentifier relatedIdentifierType='ISBN' relationType='IsPartOf'>978-331973358-6</relatedIdentifier> <subjects> <subject>Multiset rewriting</subject> <subject>Non-cooperative P systems</subject> <subject>normal form</subject> <subject>P systems</subject> <subject>Randomized rules</subject> <subject>Right-hand sides</subject> </subjects> <dates> <date dateType='Issued'>2018</date> </dates> <resourceType resourceTypeGeneral='Text'>Conference Paper</resourceType> <descriptions> <description xml:lang='en' descriptionType='Abstract'><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></description> </descriptions> <formats> <format>uri</format> </formats> </resource>