Simulating Turing Machines by P Systems with External Output

• Autorzy: Romero-Jiménez A. , Pérez-Jiménez M.J.
• Języki publikacji: EN

Abstrakty

EN

In [3] a variant of the computation model introduced by Gh. Pun 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 recursively enumerable languages, instead of their images through Parikh mapping, as it is done in [3].

Słowa kluczowe

EN

natural computing; membrane computing; Turing machine

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2002
• Tom: Vol. 49, nr 1-3
• Strony: 273--287
• Opis fizyczny: bibliogr. 4 poz.

Twórcy

autor

Romero-Jiménez A.

autor

Pérez-Jiménez M.J.

• Dpto Ciencias de la Computacion e Inteligencia Artificial, Universidad de Sevilla, Espana,

Bibliografia

• [1] Paun, Gh.: Computing with membrancs, Journal of Computer and System Sciences, 61(1), 2000, 108-143, and Turku Center for Computer Science-TUCS Report No. 208,1998 (www.tucs.fi).
• [2] P&un, Gh., Rozenberg, G.: A guide to membranę computing, Theoretical Computer Sciences, to appear.
• [3] PSun, Gh., Rozenberg, G., Salomaa, A.: Membranę computing with extemal output, Fundamenta Informati-cae, 41(3), 2000, 313-340.
• [4] The P Systems Web Page (http: //bioinformatics. bio. disco.unimib. it/psystems/).