Articolul precedent |
Articolul urmator |
![]() |
![]() ![]() |
![]() 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 | ||||||
|
||||||
Pag. 13-41 | ||||||
|
||||||
![]() |
||||||
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. |
||||||
|
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ă al AŞM, Moldova, Republica</affiliation> </creator> <creator> <creatorName>Freund, R.</creatorName> <affiliation>Faculty of Informatics, TU Wien, Austria</affiliation> </creator> <creator> <creatorName>Ivanov, S.V.</creatorName> <affiliation>University of Paris-Est , Franţa</affiliation> </creator> </creators> <titles> <title xml:lang='en'>P Systems with Randomized Right-hand Sides of Rules</title> </titles> <publisher>Instrumentul Bibliometric National</publisher> <publicationYear>2017</publicationYear> <relatedIdentifier relatedIdentifierType='ISBN' relationType='IsPartOf'>978-84-946316-1-0</relatedIdentifier> <dates> <date dateType='Issued'>2017</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 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></description> </descriptions> <formats> <format>application/pdf</format> </formats> </resource>