| Articolul precedent |
| Articolul urmator |
 |
 304 0 |
 SM ISO690:2012ALHAZOV, Artiom, FREUND, Rudolf, VERLAN, Sergey. Computational completeness of P systems using maximal variants of the Set derivation mode. In: Brainstorming Week on Membrane Computing, 1-5 februarie 2016, Sevilla. Sevilla, Spania: Universidad de Sevilla, 2016, Ediția a 14-a, pp. 59-84. |
| 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 | ||||||
|
||||||
| Pag. 59-84 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
We consider P systems only allowing rules to be used in at most one copy in each derivation step, especially the variant of the maximally parallel derivation mode where each rule may only be used at most once. Moreover, we also consider the derivation mode where from those sets of rules only those are taken which have the maximal number of rules. We check the computational completeness proofs of several variants of P systems and show that some of them even literally still hold true for the for these two new set derivation modes. Moreover, we establish two new results for P systems using target selection for the rules to be chosen together with these two new set derivation modes. |
||||||
|
|
|
|
