Skip to main content
Springer Nature Link
Log in

P systems with local graph productions

  • Special Feature
  • Published:
New Generation Computing Aims and scope Submit manuscript

Abstract

P systems (membrane systems) of various types so far mainly have been considered as computing devices working on multisets or strings. In this paper we investigate P systems with local graph productions generating weakly connected directed graphs. At least when equipped with a priority relation on the rules, such P systems can generate any recursively enumerable language of weakly connected directed graphs with only one membrane.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Bunke, H., “On the Generative Power of Sequential and Parallel Programmed Graph Grammars”,Computing, 29, pp. 89–112, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  2. Ceterchi, R., Pâun, Gh. and Subramanian, K. G., “Array-rewriting P Systems”, Submitted, 2003.

  3. Dassow, J. and Pâun, Gh.,Regulated Rewriting in Formal Language Theory, Springer-Verlag, Berlin, 1989.

    Google Scholar 

  4. Freund, R., “Generalized P Systems”,Fundamentals of Computation Theory (Ciobanu, G. and Pâun, Gh. eds.),FCT’99, Iaşi, 1999, LNCS 1684, pp. 281–292, Springer-Verlag, 1999.

  5. Freund, R. and Haberstroh, B., “Attributed Elementary Programmed Graph Grammars”,Proc. 17 th Intern. Workshop on Graph-Theoretic Concepts in Computer Science, LNCS 570, pp. 75–84, Springer-Verlag, 1991.

  6. Habel, A., “Hyperedge Replacement”,LNCS 643, Springer-Verlag, Berlin, 1992.

    Google Scholar 

  7. Pâun, Gh., “Computing with Membranes”,Journal of Computer and System Sciences, 61, 1, pp. 108–143, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  8. Pâun, Gh.,Membrane Computing. An Introduction, Springer-Verlag, Berlin, 2002.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Technische Universität Wien, Wien, Austria

    Rudolf Freund & Marion Oswald

Authors
  1. Rudolf Freund
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Marion Oswald
    View author publications

    You can also search for this author inPubMed Google Scholar

Additional information

Rudolf Freund, Ph.D.: He holds a master and doctor degree in computer science and a master degree in mathematics and physics. Since 1995 he is Associate Professor at the Vienna University of Technology in Austria. His research interests include array and graph grammars, regulated rewriting, infinite words, syntactic pattern recognition, neural networks, and especially models and systems for biological computing. In these fields, he is author or co-author of more than ninety scientific papers.

Marion Oswald, Ph.D.: She received her master and doctor degree in computer science from the Vienna University of Technology, Austria, in 2001 and 2003, respectively. Her research interests include but are not limited to artificial life as well as models and systems for biological computing, in which fields she is author or co-author of more than fifteen scientific papers.

About this article

Cite this article

Freund, R., Oswald, M. P systems with local graph productions. New Gener Comput 22, 365–375 (2004). https://doi.org/10.1007/BF03037287

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03037287

Keywords