Complexity of simulating R systems by P systems
Închide
Articolul precedent
Articolul urmator
390 0
SM ISO690:2012
ALHAZOV, Artiom, AMAN, Bogdan, FREUND, Rudolf, IVANOV, Sergiu. Complexity of simulating R systems by P systems. In: Brainstorming Week on Membrane Computing, 1-5 februarie 2016, Sevilla. Sevilla, Spania: Universidad de Sevilla, 2016, Ediția a 14-a, pp. 1-14.
EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core
Brainstorming Week on Membrane Computing
Ediția a 14-a, 2016
Masa rotundă "14th Brainstorming Week on Membrane Computing"
Sevilla, Spania, 1-5 februarie 2016

Complexity of simulating R systems by P systems


Pag. 1-14

Alhazov Artiom1, Aman Bogdan2, Freund Rudolf3, Ivanov Sergiu4
 
1 Institute of Mathematics and Computer Science ASM,
2 Institute for Computer Science, Romanian Academy, Iasi Branch,
3 Faculty of Informatics, TU Wien,
4 University of Paris-Est
 
 
Disponibil în IBN: 8 mai 2021


Rezumat

We show multiple ways to simulate R systems by non-cooperative P systems with atomic control by promoters and/or inhibitors, or with matter-antimatter annihilation rules, with a slowdown by a factor of constant. The descriptional complexity is also linear with respect to that of simulated R system. All these constants depend on how general the model of R systems is, as well as on the chosen control ingredients of P systems. Special attention is paid to the di erences in the mode of rule application in these models.

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>Aman, B.</dc:creator>
<dc:creator>Freund, R.</dc:creator>
<dc:creator>Ivanov, S.V.</dc:creator>
<dc:date>2016</dc:date>
<dc:description xml:lang='en'><p>We show multiple ways to simulate R systems by non-cooperative P systems with atomic control by promoters and/or inhibitors, or with matter-antimatter annihilation rules, with a slowdown by a factor of constant. The descriptional complexity is also linear with respect to that of simulated R system. All these constants depend on how general the model of R systems is, as well as on the chosen control ingredients of P systems. Special attention is paid to the di erences in the mode of rule application in these models.</p></dc:description>
<dc:source>Brainstorming Week on Membrane Computing (Ediția a 14-a) 1-14</dc:source>
<dc:title>Complexity of simulating R systems by P systems</dc:title>
<dc:type>info:eu-repo/semantics/article</dc:type>
</oai_dc:dc>