Membrane computing with external output
Fundamenta Informaticae
Journal of Computer and System Sciences
Theoretical Computer Science - Natural computing
Decision P Systems and the P!=NP Conjecture
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
A Framework for Complexity Classes in Membrane Computing
Electronic Notes in Theoretical Computer Science (ENTCS)
An approach to computational complexity in membrane computing
WMC'04 Proceedings of the 5th international conference on Membrane Computing
Hi-index | 0.00 |
In [3] a variant of the computation model introduced by Gh. Paun in [1] is considered: membrane systems with external output, which were proven to be universal, in the sense that they are able to generate all Parikh images of recursively enumerable languages. Here we give another proof of the universality of this model. The proof is carried out associating to each deterministic Turing machine a P system with external output that simulates its running. Thus, although we work with symbol-objects, we get strings as a result of computations, and in this way we generate directly all reeursively enumerable languages, instead of their images through Parikh mapping, as it is done in [3].