| Articolul precedent |
| Articolul urmator |
 |
 322 0 |
 SM ISO690:2012ALHAZOV, Artiom, KRASSOVITSKIY, Alexander, ROGOZHIN, Yurii, VERLAN, Sergey. P Systems with Minimal Insertion and Deletion. In: Brainstorming Week on Membrane Computing, 2-6 februarie 2009, Sevilla. Sevilla, Spania: Fénix Editora, 2009, Ediția a 7-a, pp. 9-21. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
| Brainstorming Week on Membrane Computing Ediția a 7-a, 2009 |
|
|
Masa rotundă "Seventh Brainstorming Week on Membrane Computing" Sevilla, Spania, 2-6 februarie 2009 | |
|
|
| Pag. 9-21 | |
 Descarcă PDF |
|
| Rezumat | |
In this paper we consider insertion-deletion P systems with priority of deletion over the insertion.We show that such systems with one symbol context-free insertion and deletion rules are able to generate PsRE. If one-symbol one-sided context is added to insertion or deletion rules but no priority is considered, then all recursively enumerable languages can be generated. The same result holds if a deletion of two symbols is permitted. We also show that the priority relation is very important and in its absence the corresponding class of P systems is strictly included in MAT. |
|
|
|
|
|
