Name
Abstract | ||
|---|---|---|
In this paper we study P systems using string-objects where the communication between the regions is indicated by the occurrence of so-called query symbols in the string. We define two variants of communication and prove that these systems with both types of communication are computationally complete, even having a number of membranes limited with relatively small constants. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-77312-2_14 | Workshop on Membrane Computing |
Keywords | Field | DocType |
string object,small constant,so-called query symbol,p system | Computer science,Theoretical computer science | Conference |
Volume | ISSN | ISBN |
4860 | 0302-9743 | 3-540-77311-8 |
Citations | PageRank | References |
1 | 0.36 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Erzsébet Csuhaj-Varjú | 1 | 593 | 87.27 |
| György Vaszil | 2 | 277 | 40.65 |