Unexpected universality results for three classes of P systems with symport/antiport

Natural Computing

Volumn 2, Issue 4, 2003, Pages 337-348

  Ionescu, Mihai ^a   Martín Vide, Carlos ^b   Pǎun, Andrei ^c   Pǎun, Gheorghe ^b,d  

^a UNIVERSITY OF BUCHAREST   (Romania)

^b UNIVERSITAT ROVIRA I VIRGILI   (Spain)

^c UNIVERSITY OF WESTERN ONTARIO   (Canada)

^d INSTITUTE OF MATHEMATICS   (Romania)

Author keywords

Chomsky hierarchy; Membrane computing; P system; Turing computability

Indexed keywords

ARTICLE; COMPUTER ANALYSIS; COMPUTER LANGUAGE; CONTROLLED STUDY; MATHEMATICAL ANALYSIS; MEMBRANE; MEMBRANE TRANSPORT;

EID: 4344670328     PISSN: 15677818     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:NACO.0000006773.31625.55     Document Type: Article

References (18)

1. Alberts B et al. (1998) Essential cell biology. An introduction to the molecular biology of the cell. Garland Publ. Inc., New York, London
2. Ardelean II (2002) The relevance of cell membranes for P systems. General aspects. Fundamenta Informaticae 49: 35-43
3. Csuhaj-Varju E and Vaszil G (2002) P automata. Pre-Proceedings of Workshop on Membrane Computing, Curtea de Argeş, Romania, 2002, MolCoNet Publication No. 1, pp. 177-192
4. Freund R and Oswald M (2002) A short note on analysing P systems. Bulletin of the EATCS 78 (October 2002): 231-236
5. Freund R and Pǎun Gh (2001) On the number of non-terminal symbols in graph-controlled, programmed and matrix grammars. In: Margenstern M and Rogozhin Y (eds) Proc. Conf. Universal Machines and Computations, Chişinǎu, 2001, LNCS 2055, pp. 214-225. Springer-Verlag
6. Frisco P and Hoogeboom HJ (2002) Simulating counter automata by P systems with symport/antiport. Pre-Proceedings of Workshop on Membrane Computing, Curtea de Argeş, Romania, 2002, MolCoNet Publication No. 1, pp. 237-248
7. Ionescu M. Martín-Vide C and Pǎun Gh (2002) P systems with symport/antiport rules: The traces of objects. Grammars 5: 65-79
8. Martín-Vide C, Pǎun A and Pǎun Gh (2002) On the power of P systems with symport rules. Journal of Universal Computer Science 8: 317-331
9. Martín-Vide C. Pǎun A, Pǎun Gh and Rozenberg G (2002) Membrane systems with coupled transport: Universality and normal forms. Fundamenta Informaticae 49: 1-15
10. Martín-Vide C and Pǎun Gh (2001) Elements of Formal Language Theory for Membrane Computing. Technical Report 21/01 of the Research Group on Mathematical Linguistics, Rovira i Virgili University, Tarragona
11. Pǎun A (2002) Membrane systems with symport/antiport: universality results. Pre-Proceedings of Workshop on Membrane Computing, Curtea de Argeş, Romania, 2002, MolCoNet Publication No. 1, pp. 333-343
12. Pǎun A and Páaun Gh (2002) The power of communication: P systems with symport/antiport. New Generation Computing 20: 295-306
13. Pǎun A, Pǎun Gh and Rodriguez-Paton A (2001) Further remarks on P systems with symport rules. Ann. Univ. Al.I. Cuza, Iaşi 10: 3-18
14. Pǎun A, Pǎun Gh and Rozenberg G (2002) Computing by communication in networks of membranes. International Journal of Fundamentals of Computer Science 13: 779-798
15. Pǎun Gh (2000) Computing with membranes. Journal of Computer and System Sciences 61: 108-143, and Turku Center for Computer Science-TUCS Report No. 208, 1998 (www.tucs.fi)
16. Pǎun Gh (2002) Computing with Membranes: An Introduction. Springer-Verlag, Berlin
17. Pǎun Gh, Rozenberg G and Salomaa A (2000) Membrane computing with external output. Fundamenta Informaticae 41: 259-266
18. Sosik P (2002) P systems versus register machines: Two universality proofs. Pre-Proceedings of Workshop on Membrane Computing, Curtea de Argeş, Romania, 2002, MolCoNet Publication No. 1, pp. 371-382