Membrane systems with symport/antiport rules: Universality results

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2597, Issue , 2003, Pages 270-287

  Freund, Rudolf ^a   Pǎun, Andrei ^b  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS; MOLECULES;

ANTIPORTS; COMMUNICATING P SYSTEM; COMPUTING POWER; MEMBRANE SYSTEM; P SYSTEMS; SYMPORT/ANTIPORT; SYMPORTS;

MEMBRANES;

EID: 35248843123     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36490-0_18     Document Type: Article

References (25)

1. Alberts, B., et al.: Essential Cell Biology. An Introduction to the Molecular Biology of the Cell. Garland Publ. Inc., New York, London (1998)
2. Calude, C.S., Pǎun, Gh.: Computing with Cells and Atoms. Taylor & Francis, London (2001)
3. Dassow, J., Pǎun, Gh.: Regulated Rewriting in Formal Language Theory. Springer-Verlag, Berlin (1989)
4. Freund, R., Oswald, M.: GP Systems with Forbidding Context. Fundamenta Informaticae 49, 1-3 (2002) 81-102
5. Freund, R., Oswald, M.: P Systems with Activated/Prohibited Membrane Channels, this volume
6. Freund, R., Pǎun, Gh.: On the Number of Non-terminals in Graph-controlled, Programmed, and Matrix Grammars. In: Margenstern, M., Rogozhin, Y. (eds.): Proc. Conf. Universal Machines and Computations, Chişinǎu (2001). Springer-Verlag, Berlin (2001)
7. Freund, R., Pǎun, Gh.: From Regulated Rewriting to Computing with Membranes: Collapsing Hierarchies; to appear in TCS
8. Frisco, P., Hoogeboom, H.J.: Simulating Counter Automata by P Systems with Symport/Antiport. In: [21] 237-248
9. Martin-Vide, C., Pǎun, A., Pǎun, Gh.: On the Power of P Systems with Symport Rules. J. Universal Computer Sci. 8 2 (2002) 317-331
10. Martin-Vide, C., Pǎun, A., Pǎun, Gh., Rozenberg, G.: Membrane Systems with Coupled Transport: Universality and Normal Forms. Fundamenta Informaticae 49, 1-3 (2002) 1-15
11. Martin-Vide, C., Pǎun, Gh.: Elements of Formal Language Theory for Membrane Computing. Technical Report 21/01 of the Research Group on Mathematical Linguistics, Rovira i Virgili University, Tarragona (2001)
12. Minsky, M.L.: Finite and Infinite Machines. Prentice Hall, Englewood Cliffs, New Jersey (1967)
13. The P Systems Web Page: http://psystems.disco.unimib.it/
14. Pǎun, A., Pǎun, Gh.: The Power of Communication: P Systems with Symport/Antiport. New Generation Computing 20, 3 (2002) 295-306
15. Pǎun, A., Pǎun, Gh., Rodriguez-Paton, A.: Further Remarks on P Systems with Symport Rules. Ann. Univ. Al.I. Cuza, Iaşi 10 (2001) 3-18
16. Pǎun, A., Pǎun, Gh., Rozenberg, G.: Computing by Communication in Networks of Membranes. International Journal of Foundations of Computer Science (2002) accepted
17. Pǎun, Gh.: Computing with Membranes. Journal of Computer and System Sciences 61, 1 (2000) 108-143,
18. TUCS Research Report 208 (1998) (http://www.tucs.fi)
19. Pǎun, Gh.: Computing with Membranes: An Introduction. Bulletin EATCS 67 (1999) 139-152
20. Pǎun, Gh.: Membrane Computing: An Introduction. Springer-Verlag, Berlin (2002)
21. Pǎun, Gh., Perez-Jimenez, M., Sancho-Caparrini, F.: On the Reachability Problem for P Systems with Symport/Antiport. 10th Intern. Conf. on Automata and Formal Languages, Debrecen, 2002
22. Pǎun, Gh., Zandron, C. (eds.): Pre-Proceedings of Workshop on Membrane Computing (WMC-CdeA2002), Curtea de Argeş, Romania (2002)
23. Salomaa, A., Rozenberg, G. (eds.): Handbook of Formal Languages. Springer-Verlag, Berlin (1997)
24. Sosík, P.: P Systems Versus Register Machines: Two Universality Proofs. In: [21] 371-382
25. Sosík, P., Matysek, J.: Membrane Computing: When Communication is Enough. In: Calude, C.S., Dinneen, M.J., Peper, F. (eds.): Unconventional Models of Computation 2002, LNCS 2509, Springer-Verlag, Berlin (2002) 264-275