Name
Abstract | ||
|---|---|---|
We consider the (d-dimensional) array counterpart of string insertion and deletion grammars and use the operations of array insertion and deletion in the framework of P systems where the applicability of the rules depends on the membrane region. In this paper, we especially focus on examples of two-dimensional array insertion and deletion P systems and show that we can already obtain computational completeness using such P systems with a membrane structure of tree height of at most two and only the targets here, in, and out. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-642-39074-6_8 | UNCONVENTIONAL COMPUTATION AND NATURAL COMPUTATION |
Field | DocType | Volume |
Rule-based machine translation,Topology,Membrane region,Computer science,Membrane structure,Membrane computing,Completeness (statistics) | Conference | 7956 |
ISSN | Citations | PageRank |
0302-9743 | 2 | 0.39 |
References | Authors | |
15 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Henning Fernau | 1 | 1646 | 162.68 |
| Rudolf Freund | 2 | 12 | 2.39 |
| Sergiu Ivanov | 3 | 34 | 12.84 |
| Markus L. Schmid | 4 | 93 | 15.93 |
| K. G. Subramanian | 5 | 339 | 59.27 |