Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Results on catalytic and evolution-communication P systems

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

Abstract

In this paper we give several improved universality results for two important classes of P systems: P systems with catalysts and evolution-communication P systems. First, the result from Reference,14) stating that six catalysts ensure the universality, has been improved in two ways: using bistable catalysts and using moving catalysts. Specifically, the universality can be reached with one bistable catalyst and 2 usual catalysts (using five membranes), as well as with one moving catalyst and three membranes, or with two moving catalysts and only two membranes. The second part of the paper deals with evolution-communication P systems, and we also give improved universality results for this type of systems, in terms of the weight of symport/antiport rules, number of membranes, or number of catalysts.

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. Bernardini, F. and Manca, V., “P Systems with Boundary Rules,” inMembrane Computing. Workshop on Membrane Computing, Curtea de Argeş (Pâun, G., Rozenberg, G., Salomaa, A. and Zandron, C. eds.), pp. 107–118, 2003.

  2. Cavaliere, M., “Evolution-Communication P Systems”, inMembrane Computing. Workshop on Membrane Computing, Curtea de Argeş (Pâun, G., Rozenberg, G., Salomaa, A. and Zandron, C. eds.), pp. 134–145, 2003.

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

    Google Scholar 

  4. Freund, R., Martin-Vide, C. and Pâun, G., “From Regulated Rewriting to Computing with Membranes: Collapsing Hierarchies”,Th. Computer Sci., To Appear.

  5. Freund, R. and Oswald, M., “GP Systems with Forbidding Contexts”,Fundamenta Informaticae, 49, 1–3, pp. 81–102, 2002.

    MATH  MathSciNet  Google Scholar 

  6. Freund, R. and Oswald, M., “P Systems with Activated/Prohibited Membrane Channels”, inMembrane Computing. Workshop on Membrane Computing, Curtea de Argeş (Pâun, G., Rozenberg, G., Salomaa, A. and Zandron, C. eds.), pp. 261–269, 2003.

  7. Freund, R. and Pâun, G., “On the Number of Non-terminals in Graph-controlled, Programmed, and Matrix Grammars”,Proc. Third Int. Conf. on Universal Machines and Computations, Chişinâu, Moldova, 2001 (Margenstern, M. and Rogozhin, Y. eds.),Lecture Notes in Computer Science 2055, pp. 214–225, Springer-Verlag, Berlin, 2001.

    Google Scholar 

  8. Hopcroft, J. and Ulmann, J.,Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, 1979.

  9. Minsky, M. L.,Finite and Infinite Machines, Prentice Hall, Englewood Cliffs, New Jersey, 1967.

    MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  11. Pâun, G.,Membrane Computing: An Introduction, Springer-Verlag, Berlin, 2002.

    MATH  Google Scholar 

  12. Pâun, G., Rozenberg, G., Salomaa, A. and Zandron, C. (eds.),Membrane Computing. Workshop on Membrane Computing, Curtea de Arges, 2002, Selected Papers, Lecture Notes in Computer Science 2597, Springer-Verlag, Berlin, 2003.

    Google Scholar 

  13. Salomaa, A.,Formal Languages, Academic Press, New York, 1973.

    MATH  Google Scholar 

  14. Sosik, P., “P Systems Versus Register Machines: Two Universality Proofs”,Pre-Proc. of Workshop on Membrane Computing, pp. 371–382, Curtea de Argeş, Romania, Aug. 19–23, 2002.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering IIT, Bombay, India

    Shankara Narayanan Krishna

  2. Department of Computer Science College of Engineering and Science, Louisiana Tech University, Ruston, P.O. Box 10348, 1272, Louisiana, LA-7, USA

    Andrei Pâun

Authors
  1. Shankara Narayanan Krishna
    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

Additional information

Shankara Narayanan Krishna: She is an Assistant Professor in Dept. Computer Science & Engg, IIT Bombay, India. Her research interests are Natural Computing and Formal Methods.

Andrei Paun, Ph.D.: He obtained his bachelor degree in Mathematics and Computer Science from the University of Bucharest, Romania. He obtaind his Ph.D. degree in Computer Science, at University of Western Ontario, Canada, under the supervision of Prof. Dr. Sheng Yu, with the thesis “Unconventional Models of Computation: DNA and Membrane Computing”. After graduation he received a postdoctoral felloship from NSERC, Canada and after six months he accepted an assistant professor position in US at Louisiana Tech University.

About this article

Cite this article

Krishna, S.N., Pâun, A. Results on catalytic and evolution-communication P systems. New Gener Comput 22, 377–394 (2004). https://doi.org/10.1007/BF03037288

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation