Repositorio de producción científica de la Universidad de Sevilla

Complexity of Simulating R Systems by P Systems

 

Advanced Search
 
Opened Access Complexity of Simulating R Systems by P Systems
Cites
Show item statistics
Icon
Export to
Author: Alhazov, Artiom
Aman, Bogdan
Freund, Rudolf
Ivanov, Sergiu
Date: 2016
Published in: BWMC 2016 : 14th Brainstorming Week on Membrane Computing : Sevilla, February 1-5 (2016), p 1-14
Document type: Presentation
Abstract: 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 annihi- lation 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.
Cite: Alhazov, A., Aman, B., Freund, R. y Ivanov, S. (2016). Complexity of Simulating R Systems by P Systems. En BWMC 2016 : 14th Brainstorming Week on Membrane Computing : Sevilla, February 1-5 (1-14), Sevilla: Fénix.
Size: 290.2Kb
Format: PDF

URI: http://hdl.handle.net/11441/49265

See editor´s version

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)