Skip to main content
SpringerLink
Log in

P systems with active membranes and without polarizations

  • Focus
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

P systems with active membranes but without using electrical charges (polarizations) are shown to be complete for generating recursively enumerable string languages when working on string objects and using only rules with membrane transitions as well as rules with membrane dissolving and elementary membrane division, but also when using various other kinds of rules, even including a new type of rules allowing for membrane generation. In particular, allowing for changing membrane labels turns out to be a very powerful control feature.

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

  • Dassow J, Păun Gh (1989) Regulated rewriting in formal language theory. Springer, Berlin

  • Freund R, Oswald M (2002) GP systems with forbidding context. Fundamenta Informaticae 49:81–102

    Google Scholar 

  • Freund R, Martín-Vide C, Păun Gh (2004) From regulated rewriting to computing with membranes: collapsing hierarchies. Theoretical Computer Science 312:143–188

    Google Scholar 

  • Hopcroft J, Ulmann J (1979) Introduction to automata theory, languages, and computation. Addison-Wesley Reading Mass

  • Krishna SN, Rama R (1999) A variant of P systems with active membranes: solving NP-complete problems. Romanian J. of Information Science and Technology 2:357–367

    Google Scholar 

  • The P Systems Web Page: http://psystems.disco.unimib.it/

  • Păun A (2000) On P systems with active membranes. Proc. of the First International Conference on Unconventional Models of Computation (UMC2K). In: Antoniou I, Calude CS, Dinneen MJ (eds) Discrete Mathematics and Theoretical Computer Science. Springer, Berlin, pp 187–201

  • Păun Gh (2000) Computing with membranes. Journal of Computer and System Sciences 61:108–143 and TUCS Research Report 208 (1998) (http://www.tucs.fi)

    Google Scholar 

  • Păun Gh (2001) P systems with active membranes: attacking NP-complete problems. Journal of Automata, Languages and Combinatorics 6:75–90

    Google Scholar 

  • Păun Gh (2002) Membrane computing: an introduction. Springer, Berlin

  • Păun Gh, Suzuki Y, Tanaka H, Yokomori T (2000) On the power of membrane division in P systems. Proc. Conf. on Words, Languages, and Combinatorics, Kyoto, and Theoretical Computer Science, in press

  • Rozenberg G, Salomaa A (eds) (1997) Handbook of formal languages. Springer, Berlin

Download references

Author information

Authors and Affiliations

  1. Faculty of Informatics, Vienna University of Technology, Favoritenstr. 9, A-1040, Wien, Austria

    Rudolf Freund

  2. Department of Computer Science, Louisiana Tech University, PO Box 10348, Ruston, Louisiana, LA, 71272, USA

    Andrei Păun

Authors
  1. Rudolf Freund
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrei Păun
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rudolf Freund.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Freund, R., Păun, A. P systems with active membranes and without polarizations. Soft Comput 9, 657–663 (2005). https://doi.org/10.1007/s00500-004-0395-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-004-0395-2

Keywords

Search

Navigation