Name
Abstract | ||
|---|---|---|
In this paper, we examine P systems with a linear membrane structure, i.e., P systems in which only one membrane is elementary and the output of which is read out as the sequence of membrane labels in the halting configuration or vectors/numbers represented by this sequence. We investigate the computational power of such systems, depending on the number of membrane labels, kinds of rules used, and some other possible restrictions. We prove that two labels, elementary membrane creation and dissolution, together with the usual send-in and send-out rules, suffice to achieve computational completeness, even with the restriction that only one object is allowed to be present in any configuration of the system. On the other hand, limiting the number of labels to one reduces the computational power to the regular sets of non-negative integers. We also consider other possible variants of such P systems, e.g., P systems in which all membranes but one have the same label, P systems with membrane duplication rules, or systems in which multiple objects are allowed to be present in a configuration, and we describe the computational power of all these models. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.3233/FI-2014-1088 | Fundam. Inform. |
Keywords | Field | DocType |
biological membranes,linear systems,completeness theorem,computational complexity | Integer,Discrete mathematics,Combinatorics,Linear system,Biological membrane,Gödel's completeness theorem,Membrane structure,Membrane,Completeness (statistics),Mathematics,Computational complexity theory | Journal |
Volume | Issue | ISSN |
134 | 1-2 | 0169-2968 |
Citations | PageRank | References |
2 | 0.37 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Artiom Alhazov | 1 | 642 | 68.17 |
| Rudolf Freund | 2 | 1000 | 109.64 |
| Sergiu Ivanov 0001 | 3 | 71 | 8.86 |