Name
Abstract | ||
|---|---|---|
We study two very simple variants of P colonies: systems with only one object inside the cells, and systems with insertion-deletion programs, so called P colonies with senders and consumers. We show that both of these extremely simple types of systems are able to compute any recursively enumerable set of vectors of non-negative integers. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.15837/ijccc.2009.3.2430 | INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL |
Keywords | Field | DocType |
P systems, colonies, P colonies, register machines | Discrete mathematics,Recursively enumerable set,Computer science,Simple cell | Journal |
Volume | Issue | ISSN |
4 | 3 | 1841-9836 |
Citations | PageRank | References |
10 | 0.80 | 3 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lucie Ciencialová | 1 | 45 | 11.98 |
| Erzsébet Csuhaj-Varjú | 2 | 593 | 87.27 |
| Alica Kelemenová | 3 | 195 | 30.45 |
| György Vaszil | 4 | 277 | 40.65 |