Skip to main content
SpringerLink
Log in

Computing with Membranes (P Systems): Universality Results

  • Conference paper
  • First Online:
Machines, Computations, and Universality (MCU 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2055))

Included in the following conference series:

Abstract

This is a survey of universality results in the area of Membrane Computing (P systems), at the level of December 20001. We consider both P systems with symbol-objects and with string-objects; in the latter case, we consider systems based on rewriting, splicing, as well as rewriting together with other operations (replication, crossingover), with sets or with multisets of strings. Besides recalling characterizations of recursively enumerable languages and of recursively enumerable sets of vectors of natural numbers, we also briefly discuss the techniques used in the proofs of such results. Several open problems are also formulated.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. Bottoni, C. Martin-Vide, Gh. Păun, G. Rozenberg, Membrane systems with promoters/inhibitors, submitted, 2000.

    Google Scholar 

  2. P. Bottoni, A. Labella, C. Martin-Vide, Gh. Păun, Rewriting P systems with conditional communication, submitted, 2000.

    Google Scholar 

  3. D. Bray, Protein molecules as computational elements in living cells, Nature, 376 (1995), 307–312

    Article  Google Scholar 

  4. C. Calude, Gh. Păun, Computing with Cells and Atoms, Taylor and Francis, London, 2000.

    Google Scholar 

  5. J. Castellanos, A. Rodriguez-Paton, Gh. Păun, Computing with membranes: P systems with worm-objects, IEEE 7th. Intern. Conf. on String Processing and Information Retrieval, SPIRE 2000, La Coruna, Spain, 64–74.

    Google Scholar 

  6. J. Dassow, Gh. Păun, Regulated Rewriting in Formal Language Theory, Springer-Verlag, Berlin, 1989.

    Google Scholar 

  7. Cl. Ferretti, G. Mauri, Gh. Păun, Cl. Zandron, Further remarks on P systems with string-objects, submitted, 2000.

    Google Scholar 

  8. R. Freund, Generalized P systems, Fundamentals of Computation Theory, FCT’99, Iaşi, 1999 (G. Ciobanu, Gh. Păun, eds.), LNCS 1684, Springer, 1999, 281–292.

    Chapter  Google Scholar 

  9. R. Freund, Generalized P systems with splicing and cutting/recombination, Workshop on Formal Languages, FCT’99, Iaşi, 1999, Grammars, 2, 3(1999), 189–199.

    MATH  MathSciNet  Google Scholar 

  10. R. Freund, Sequential P systems, Pre-proc. Workshop on Multiset Processing, Curtea de Argeş, Romania, 2000, and Theorietag 2000; Workshop on New Computing Paradigms (R. Freund, ed.), TU University Vienna, 2000, 177–183.

    Google Scholar 

  11. R. Freund, F. Freund, Molecular computing with generalized homogeneous P systems, Proc. Conf. DNA6 (A. Condon, G. Rozenberg, eds.), Leiden, 2000, 113–125.

    Google Scholar 

  12. R. Freund, C. Martin-Vide, Gh. Păun, Computing with membranes: Three more collapsing hierarchies, submitted, 2000.

    Google Scholar 

  13. R. Freund, Gh. Păun, On the number of non-terminals in graph-controlled, programmed, and matrix grammars, submitted, 2000.

    Google Scholar 

  14. T. Head, Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors, Bulletin of Mathematical Biology, 49 (1987), 737–759.

    MATH  MathSciNet  Google Scholar 

  15. M. Ito, C. Martin-Vide, Gh. Păun, A characterization of Parikh sets of ET0L languages in terms of P systems, submitted, 2000.

    Google Scholar 

  16. S. N. Krishna, R. Rama, A variant of P systems with active membranes: Solving NP-complete problems, Romanian J. of Information Science and Technology, 2, 4 (1999), 357–367.

    Google Scholar 

  17. S. N. Krishna, R. Rama, On the power of P systems with sequential and parallel rewriting, Intern. J. Computer Math., 77, 1-2 (2000), 1–14.

    Google Scholar 

  18. S. N. Krishna, R. Rama, P systems with replicated rewriting, J. Automata, Languages, Combinatorics, to appear.

    Google Scholar 

  19. W. R. Loewenstein, The Touchstone of Life. Molecular Information, Cell Communication, and the Foundations of Life, Oxford Univ. Press, New York, 1999.

    Google Scholar 

  20. V. Manca, C. Martin-Vide, Gh. Păun, On the power of P systems with replicated rewriting, J. Automata, Languages, Combinatorics, to appear.

    Google Scholar 

  21. C. Martin-Vide, V. Mitrana, P systems with valuations, Proc. Second Conf. Unconventional Models of Computing (I. Antoniou, C. S. Calude, M. J. Dinneen, eds.), Springer-Verlag, 2000, 154–166.

    Google Scholar 

  22. C. Martin-Vide, Gh. Păun, String objects in P systems, Proc. of Algebraic Systems, Formal Languages and Computations Workshop, Kyoto, 2000, RIMS Kokyuroku, Kyoto Univ., 2000, 161–169.

    Google Scholar 

  23. C. Martin-Vide, Gh. Păun, Computing with membranes. One more collapsing hierarchy, Bulletin of the EATCS, 72 (2000), 183–187.

    MATH  Google Scholar 

  24. C. Martin-Vide, Gh. Păun, G. Rozenberg, Membrane systems with carriers, Theoretical Compuer Sci., to appear.

    Google Scholar 

  25. A. Păun, On P systems with membrane division, Proc. Second Conf. Unconventional Models of Computing (I. Antoniou, C. S. Calude, M. J. Dinneen, eds.), Springer-Verlag, 2000, 187–201.

    Google Scholar 

  26. A. Păun, M. Păun, On the membrane computing based on splicing, in vol. Words, Languages, Grammars (C. Martin-Vide, V. Mitrana, eds.), Kluwer, Dordrecht, 2000, 409–422.

    Google Scholar 

  27. Gh. Păun, Six nonterminals are enough for generating each r.e. language by a matrix grammar, Intern. J. Computer Math., 15 (1984), 23–37.

    Article  MATH  Google Scholar 

  28. Gh. Păun, Computing with membranes, Journal of Computer and System Sciences, 61, 1 (2000), 108–143(see also Turku Center for Computer Science-TUCS Report No 208, 1998, (http://www.tucs.fi).

    Article  MathSciNet  MATH  Google Scholar 

  29. Gh. Păun, Computing with membranes-A variant: P systems with polarized membranes, Intern. J. of Foundations of Computer Science, 11, 1 (2000), 167–182.

    Article  Google Scholar 

  30. Gh. Păun, P systems with active membranes: Attacking NP-complete problems, J. Automata, Languages and Combinatorics, 6, 1 (2001).

    Google Scholar 

  31. Gh. Păun, Computing with membranes; Attacking NP-complete problems, Proc. Second Conf. Unconventional Models of Computing (I. Antoniou, C. S. Calude, M. J. Dinneen, eds.), Springer-Verlag, 2000, 94–115.

    Google Scholar 

  32. Gh. Păun, G. Rozenberg, A. Salomaa, DNA Computing. New Computing Paradigms, Springer-Verlag, Berlin, 1998.

    MATH  Google Scholar 

  33. Gh. Păun, G. Rozenberg, A. Salomaa, Membrane computing with external output, Fundamenta Informaticae, 41, 3(2000), 259–266

    MathSciNet  Google Scholar 

  34. Gh. Păun, Y. Suzuki, H. Tanaka, P Systems with energy accounting, Intern. J. Computer Math., to appear.

    Google Scholar 

  35. Gh. Păun, T. Yokomori, Membrane computing based on splicing, Preliminary Proc. of Fifth Intern. Meeting on DNA Based Computers (E. Winfree, D. Gifford, eds.), MIT, June 1999, 213–227.

    Google Scholar 

  36. Gh. Păun, S. Yu, On synchronization in P systems, Fundamenta Informaticae, 38, 4 (1999), 397–410.

    MathSciNet  MATH  Google Scholar 

  37. G. Rozenberg, A. Salomaa, eds., Handbook of Formal Languages, Springer-Verlag, Heidelberg, 1997.

    MATH  Google Scholar 

  38. M. Sipper, Studying Artificial Life using a simple, general cellular model, Artificial Life Journal, 2, 1 (1995), 1–35.

    Article  Google Scholar 

  39. Cl. Zandron, G. Mauri, Cl. Ferretti, Universality and normal forms on membrane systems, Proc. Intern. Workshop Grammar Systems 2000 (R. Freund, A. Kelemenova, eds.), Bad Ischl, Austria, July 2000, 61–74.

    Google Scholar 

  40. Cl. Zandron, Cl. Ferretti, G. Mauri, Solving NP-complete problems using P systems with active membranes, Proc. Second Conf. Unconventional Models of Computing (I. Antoniou, C. S. Calude, M. J. Dinneen, eds.), Springer-Verlag, 2000, 289–301.

    Google Scholar 

  41. Cl. Zandron, Cl. Ferretti, G. Mauri, Using membrane features in P systems, Pre-proc. Workshop on Multiset Processing, Curtea de Argeş, Romania, TR 140, CDMTCS, Univ. Auckland, 2000, 296–320.

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Carlos Martín-Vide

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

    Gheorghe PĂun

Authors
  1. Carlos Martín-Vide
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gheorghe PĂun
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LITA, UFR MIM, Université de Metz, Ile du Saulcy, 57045, Metz, Cedex, France

    Maurice Margenstern

  2. Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova, 5 Academiei str, 2028, Chiŗinău, Moldova

    Yurii Rogozhin

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Martín-Vide, C., PĂun, G. (2001). Computing with Membranes (P Systems): Universality Results. In: Margenstern, M., Rogozhin, Y. (eds) Machines, Computations, and Universality. MCU 2001. Lecture Notes in Computer Science, vol 2055. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45132-3_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-45132-3_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42121-4

  • Online ISBN: 978-3-540-45132-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation