%0 Generic
%D 2002
%T Simulating Turing Machines by P systems with External Output
%A Mario J. Pérez-Jiménez
%A Álvaro Romero-Jiménez
%C Warsaw, Poland
%I IOS Press
%K Membrane computing
%K Natural computing
%K turing machines
%N 1-3
%P 273-287
%U http://iospress.metapress.com/content/8b4enyyt5pvnxmnr/?p=a68c6353270f4bf89d74cd6fbb9df5c2&pi=20
%V 49
%X 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].