Membrane Computing Schema: A New Approach to Computation Using String Insertions

  • Mario J. Pérez-JiménezEmail author
  • Takashi Yokomori
Part of the Natural Computing Series book series (NCS)


In this paper, we introduce the notion of a membrane computing schema for string objects. We propose a computing schema for a membrane network (i.e., tissue-like membrane system) where each membrane performs unique type of operations at a time and sends the result to others connected through the channel. The distinguished features of the computing models obtained from the schema are:
  1. 1.

    only context-free insertion operations are used for string generation,

  2. 2.

    some membranes assume filtering functions for structured objects (molecules),

  3. 3.

    generating model and accepting model are obtained in the same schema, and both are computationally universal,

  4. 4.

    several known rewriting systems with universal computability can be reformulated by the membrane computing schema in a uniform manner.

The first feature provides the model with a simple uniform structure which facilitates a biological implementation of the model, while the second feature suggests further feasibility of the model in terms of DNA complementarity.

Through the third and fourth features, one may have a unified view of a variety of existing rewriting systems with Turing computability in the framework of membrane computing paradigm.


Regular Language Membrane Computing Insertion Operation Enumerable Language Matrix Grammar 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Cavaliere M, Leupold P (2004) Evolution and observation—a non-standard way to generate formal languages. Theor Comput Sci 321:233–248 zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Cavaliere M, Freund R, Oswald M, Sburlan D (2007) Multiset random context grammars, checkers, and transducers. Theor Comput Sci 372:136–151 zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Chen H, Freund R, Ionescu M, Păun Gh, Pérez-Jiménez MJ (2006) On string languages generated by spiking neural P systems. In: Gutierrez-Naranjo MA, Păun Gh, Riscos-Nunez A, Romero-Campero FJ (eds) Reports on fourth brainstorming week on membrane computing, vol 1, pp 169–193 Google Scholar
  4. 4.
    Csuhaj-Varju E, Kari L, Păun Gh (1996) Test tube distributed systems based on splicing. Comput Artif Intell 15(2–3):211–232 zbMATHGoogle Scholar
  5. 5.
    Dassow J, Păun Gh (1989) Regulated rewriting in formal language theory. Springer, Berlin Google Scholar
  6. 6.
    Freund R, Oswald M (2004) Modeling grammar systems by tissue P systems working in the sequential mode. In: Proceedings of grammar systems workshop, Budapest Google Scholar
  7. 7.
    Ionescu M, Păun Gh, Yokomori T (2006) Spiking neural P systems. Fund Inform 71(2–3):279–308 zbMATHMathSciNetGoogle Scholar
  8. 8.
    Margenstern M, Mitrana V, Pérez-Jiménez M (2005) Accepting hybrid networks of evolutionary processors. In: Lecture notes in computer science, vol 3384. Springer, Berlin, pp 235–246 Google Scholar
  9. 9.
    Martin-Vide C, Mitrana V, Pérez-Jiménez M, Sancho-Caparrini F (2003) Hybrid networks of evolutionary processors. In: Proceedings of GECCO. Lecture notes in computer science, vol 2723. Springer, Berlin, pp 401–412 Google Scholar
  10. 10.
    Martin-Vide C, Păun Gh, Salomaa A (1998) Characterizations of recursively enumerable languages by means of insertion grammars. Theor Comput Sci 205:195–205 zbMATHCrossRefGoogle Scholar
  11. 11.
    Martin-Vide C, Păun Gh, Pazos J, Rodriguez-Paton A (2003) Tissue P systems. Theor Comput Sci 296:295–326 zbMATHCrossRefGoogle Scholar
  12. 12.
    Păun Gh (1998) Distributed architectures in DNA computing based on splicing: limiting the size of components. In: Calude CS, Casti J, Dinneen MJ (eds) Unconventional models of computation. Springer, Berlin, pp 323–335 Google Scholar
  13. 13.
    Păun Gh, Pérez-Jiménez MJ, Yokomori T (2007) Representations and characterizations of languages in Chomsky hierarchy by means of insertion-deletion systems. In: Proceedings of DCFS2007, High Tatras, Slovakia, pp. 129–140. Also, to appear in Int J Found Comput Sci, 2008 Google Scholar
  14. 14.
    Păun Gh, Rozenberg G, Salomaa A (1998) DNA computing. Springer, Berlin zbMATHGoogle Scholar
  15. 15.
    Păun Gh, Sakakibara Y, Yokomori T (2002) P-systems on graph of restricted forms. Publ Math Debrecen 60:635–660 zbMATHMathSciNetGoogle Scholar
  16. 16.
    Rozenberg G, Salomaa A (1997) Handbook of formal languages. Springer, Berlin zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  1. 1.Research Group on Natural Computing, Department of Computer Science and Artificial IntelligenceUniversity of SevillaSevillaSpain
  2. 2.Department of Mathematics, Faculty of Education and Integrated Arts and SciencesWaseda UniversityTokyoJapan

Personalised recommendations