Carlos Martin-Vide, Gheorghe Paun, AlfonsoRodriguez-Paton
Molecular computing, membrane computing, recursively enumerable sets, matrix grammars.
We first give a general result about P systems with symbol-objects, which says that systems with membrane creation with only one initial membrane can simulate usual systems without using additional membranes (and this implies as a direct consequence a recent result of Mutyam and Krithivasan), then we extend the membrane creation feature to P systems with string-objects and we prove the computational universality of such systems.
C.Martin-Vide, Gh.Paun, A.Rodriguez-Paton
Research Group on Mathematical Linguistics
Rovira i Virgili University
Pl. Imperial Tarraco 1, 43005 Tarragona, Spain
Institute of Mathematics of the Romanian Academy
PO Box 1-764, 70700 Bucuresti, Romania
Department of Artificial Intelligence,
Faculty of Computer Science
Polytechnical University of Madrid
Campus de Montegancedo, Boadilla del Monte 28660, Madrid, Spain
– 0.16 Mb