Presentation
Complexity of Simulating R Systems by P Systems
Author/s | Alhazov, Artiom
Aman, Bogdan Freund, Rudolf Ivanov, Sergiu |
Date | 2016 |
Published in |
|
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 ... 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. |
Citation | 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. |
Files | Size | Format | View | Description |
---|---|---|---|---|
001_bwmc2016RbyP.pdf | 290.2Kb | ![]() | View/ | |