| Articolul precedent |
| Articolul urmator |
 |
 276 0 |
 SM ISO690:2012ALHAZOV, Artiom, FREUND, Rudolf, VERLAN, Sergey. P systems working in maximal variants of the set derivation mode. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 25-29 iulie 2016, Milan. Dusseldorf, Germania: Springer Verlag, 2017, Vol. 10105 Ed. a 17-a, pp. 83-102. ISBN 978-331954071-9. ISSN 03029743. DOI: https://doi.org/10.1007/978-3-319-54072-6_6 |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 10105 Ed. a 17-a, 2017 |
||||||
|
Conferința "17th International Conference on Membrane Computing" Milan, Italia, 25-29 iulie 2016 | ||||||
|
||||||
| DOI:https://doi.org/10.1007/978-3-319-54072-6_6 | ||||||
| Pag. 83-102 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
In P systems working in the set derivation mode, even in the maximally parallel derivation mode, rules are only applied in at most one copy in each derivation step. We also consider the set mode in the cases of taking those sets of rules with the maximal number of applicable rules or with affecting the maximal number of objects. For many variants of P systems, the computational completeness proofs even literally still hold true for these new set derivation modes. On the other hand, we obtain new results for P systems using target selection for the rules to be chosen together with these set derivation modes. |
||||||
| Cuvinte-cheie Artificial Intelligence, computer science, computers |
||||||
|
|
|
|
