Skip to main content
SpringerLink
Log in

Trading polarizations for labels in P systems with active membranes

  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract.

This paper addresses the problem of removing the polarization of membranes from P systems with active membranes - and this is achieved by allowing the change of membrane labels by means of communication rules or by membrane dividing rules. As consequences of these results, we obtain the universality of P systems with active membranes which are allowed to change the labels of membranes, but do not use polarizations. Universality results are easily obtained also by direct proofs. By direct constructions, we also prove that SAT can be solved in linear time by systems without polarizations and with label changing possibilities. If non-elementary membranes can be divided, then SAT can be solved in linear time without using polarizations and label changing. Several open problems are also formulated.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  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

    Google Scholar 

  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 Argeş, 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

    Google Scholar 

  6. Madhu, M., Krithivasan, K. (2002) Improved results about the universality of P systems. Bulletin of the EATCS 76: 162-168

    Google Scholar 

  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

    Google Scholar 

  9. Păun, Gh. (2000) Computing with membranes. J. Computer System Sciences 61(1): 108-143

    Article  Google Scholar 

  10. Păun, Gh. (2001) P systems with active membranes: attacking NP-complete problems. J. Automata, Languages Combinatorics 6(1): 75-90

    Google Scholar 

  11. P aun, Gh. (2002) Computing with membranes: an introduction. Springer, Berlin Heidelberg New York

    Google Scholar 

  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

    Article  MATH  Google Scholar 

  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. Sosí k, 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

Download references

Author information

Authors and Affiliations

  1. Research Group on Mathematical Linguistics, Rovira i Virgili University, Pl. Imperial Tárraco 1, 43005, Tarragona, Spain

    Artiom Alhazov & Linqiang Pan

  2. Institute of Mathematics and Computer Science, Academy of Science of Moldova, Str. Academiei 5, 2028, Chişinău, Moldova

    Artiom Alhazov

  3. Department of Control Science and Engineering, Huazhong University of Science and Technology, 430074, Wuhan, People’s Republic of China

    Linqiang Pan

  4. Institute of Mathematics of the Romanian Academy, PO Box 1-764, 70700, Bucureşti, Romania

    Gheorghe Păun

  5. Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Sevilla, Avda. Reina Mercedes s/n, 41012, Sevilla, Spain

    Gheorghe Păun

Authors
  1. Artiom Alhazov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Linqiang Pan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gheorghe Păun
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Artiom Alhazov.

Additional information

Received: 29 October 2003, Published online: 29 October 2004

Artiom Alhazov: artiome.alhazov@estudiants

Linqiang Pan: lp@fll.urv.es

Gheorghe Păun: george.paun@imar.ro

Rights and permissions

Reprints and permissions

About this article

Cite this article

Alhazov, A., Pan, L. & Păun, G. Trading polarizations for labels in P systems with active membranes. Acta Informatica 41, 111–144 (2004). https://doi.org/10.1007/s00236-004-0153-z

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00236-004-0153-z

Keywords

Search

Navigation