P Systems with Randomized Right-hand Sides of Rules

Alhazov Artiom; Freund Rudolf; Ivanov Sergiu

Articolul precedent

Articolul urmator

310

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 Artiom¹², Freund Rudolf³, Ivanov Sergiu⁴⁵

¹ Institute of Mathematics and Computer Science ASM,
² Huazhong University of Science and Technology,
³ Faculty of Informatics, TU Wien,
⁴ University of Paris-Est ,
⁵ Necunoscută, Franţa

Disponibil în IBN: 14 mai 2021

Descarcă PDF

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.

Dublin Core Export

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc='http://purl.org/dc/elements/1.1/' xmlns:oai_dc='http://www.openarchives.org/OAI/2.0/oai_dc/' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xsi:schemaLocation='http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd'>
<dc:creator>Alhazov, A.E.</dc:creator>
<dc:creator>Freund, R.</dc:creator>
<dc:creator>Ivanov, S.V.</dc:creator>
<dc:date>2017</dc:date>
<dc:description xml:lang='en'><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></dc:description>
<dc:source>Brainstorming Week On Membrane Computing (Ediția a 15-a) 13-41</dc:source>
<dc:title>P Systems with Randomized Right-hand Sides of Rules</dc:title>
<dc:type>info:eu-repo/semantics/article</dc:type>
</oai_dc:dc>