Trading polarizations for labels in P systems with active membranes

Acta Informatica

Volumn 41, Issue 2-3, 2004, Pages 111-144

  Alhazov, Artiom ^a,b   Pan, Linqiang ^a,c   Pǎun, Gheorghe ^d,e  

^a UNIVERSITAT ROVIRA I VIRGILI   (Spain)

^b INSTITUTE OF MATHEMATICS AND COMPUTER SCIENCE   (Moldova)

^c HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

^d INSTITUTE OF MATHEMATICS   (Romania)

^e UNIVERSITY OF SEVILLE   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ACTIVE MEMBRANES; DISTRIBUTED PARALLEL COMPUTING; NON-POLARIZED MEMBRANES; P SYSTEMS;

COMPUTER ARCHITECTURE; COMPUTER SIMULATION; MEMBRANES; PARALLEL PROCESSING SYSTEMS; POLARIZATION; POLYNOMIALS; PROBLEM SOLVING;

COMPUTER SCIENCE;

EID: 10844263442     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00236-004-0153-z     Document Type: Article

References (17)

1. Alhazov, A., Martín-Vide, M., Pan, L. (2003) Solving a PSPACE-complete problem by P systems with restricted active membranes. Fundamenta Informaticae 58(2): 66-77
2. Bernardini, F., Manca, V. (2003) P systems with boundary rules. In: Pǎun, Gh., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) Membrane computing. Proc. WMC Curtea de Arges, 2002, LNCS 2597. Springer, Berlin Heidelberg New York, pp 107-118
3. Dassow, J., Pǎun, Gh. (1989) Regulated rewriting in formal language theory. Springer, Berlin Heidelberg New York
4. Garey, M.R., Johnson, D.J. (1979) Computers and intractability. A guide to the theory of np-completeness. W.H. Freeman, San Francisco
5. Hauschild, D., Jantzen, M. (1994) Petri nets algorithms in the theory of matrix grammars. Acta Informatica 31: 719-728
6. Madhu, M., Krithivasan, K. (2002) Improved results about the universality of P systems. Bulletin of the EATCS 76: 162-168
7. Papadimitriou, Ch.P. (1994) Computational complexity. Addison-Wesley, Reading, MA
8. Pǎun, A., Pǎun, Gh. (2002) The power of communication: P systems with symport/antiport. New Generation Computers 20(3): 295-306
9. Pǎun, Gh. (2000) Computing with membranes. J. Computer System Sciences 61(1): 108-143
10. Pǎun, Gh. (2001) P systems with active membranes: attacking NP-complete problems. J. Automata, Languages Combinatorics 6(1): 75-90
11. Pǎun, Gh. (2002) Computing with membranes: an introduction. Springer, Berlin Heidelberg New York
12. Pérez-Jiménez, M.J., Romero-Jiménez, A., Sancho-Caparrini, F. (2003) Complexity classes in models of cellular computation with membranes. Natural Computing 2(3): 265-285
13. Pérez-Jiménez, M.J., Romero-Jiménez, A., Sancho-Caparrini, F. (2002) Teoría de la Complejidad en Modelos de Computatión Celular con Membranas. Editorial Kronos, Sevilla
14. Rozenberg, G., Salomaa, A. (eds.) (1997) Handbook of formal languages (3 vols). Springer, Berlin Heidelberg New York
15. Salomaa, A. (1973) Formal languages. Academic Press, New York
16. Sosfk, P. (2003) Solving a PSPACE-complete problem by P systems with active membranes. In: Cavaliere, M., Martín-Vide, C., Pǎun, Gh. (eds.) Proc. of the Brainstorming Week on Membrane Computing, Report GRLMC 26/03, pp. 305-312
17. Zandron, C., Mauri, G., Ferretti, C. (2000) Universality and normal forms on membrane systems. In: Freund, R., Kelemenova, A. (eds.) Proc. Int. Workshop on Grammar Systems 2000, Bad Ischl, Austria, pp. 61-74