Skip to main content

On Descriptive Complexity of P Systems

  • Conference paper
Membrane Computing (WMC 2004)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3365))

Included in the following conference series:

Abstract

In this paper we address the problem of describing the complexity of the evolution of a P system. This issue is is specially hard in the case of P systems with active membranes, where the number of steps of a computation is not sufficient to evaluate the complexity. Sevilla carpets were introduced in [1], and they describe the space-time complexity of P systems. Based on them, we define some new parameters which can be used to compare evolutions of P systems. To illustrate this, we also include two different cellular solutions to the Subset Sum problem and compare them via these new parameters.

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

Access this chapter

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. Ciobanu, G., Păun, G., Ştefănescu, G.: Sevilla carpets associated with P systems. In: Cavaliere, M., Martín–Vide, C., Păun, G. (eds.) Proceedings of the Brainstorming Week on Membrane Computing, Tarragona, Spain, pp. 135–140. Report RGML 26/03 (2003)

    Google Scholar 

  2. Cordón-Franco, C., Gutiérrez-Naranjo, M.A., Pérez-Jiménez, M.J., Sancho-Caparrini, F.: A Prolog simulator for deterministic P systems with active membranes. New Generation Computing 22(4), 349–363 (2004)

    Article  MATH  Google Scholar 

  3. Gutiérrez-Naranjo, M.A., Pérez-Jiménez, M.J., Riscos-Núñez, A.: Towards a programming language in cellular computing. In: Proceedings of the 11th Workshop on Logic, Language, Information and Computation (WoLLIC 2004), 1-16 Campus de Univ. Paris 12, Paris, France, July 19-22 (2004); A preliminary version In: Păun, G., Riscos, A., Romero, A., Sancho, F. (eds.) Proceedings of the Second Brainstorming Week on Membrane Computing, Report RGNC 01/04, pp. 247–257 (2004)

    Google Scholar 

  4. Gutiérrez-Naranjo, M.A., Pérez-Jiménez, M.J., Riscos-Núñez, A.: A fast P system for finding a balanced 2-partition. Soft Computing (to appear)

    Google Scholar 

  5. Mäkinen, E.: A Bibliography on Szilard Languages. Dept. of Computer and Information Sciences, University of Tampere, http://www.cs.uta.fi/reports/pdf/Szilard.pdf

  6. Mateescu, A., Salomaa, A.: Aspects of classical language theory. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 1. Springer, Heidelberg (1997)

    Google Scholar 

  7. Păun, G.: P systems with active membranes: Attacking NP complete problems. Journal of Automata, Languages and Combinatorics 6(1), 75–90 (2001)

    MATH  MathSciNet  Google Scholar 

  8. Păun, G.: Membrane Computing. An Introduction. Springer, Berlin (2002)

    MATH  Google Scholar 

  9. Pérez-Jiménez, M.J., Riscos-Núñez, A.: Solving the Subset Sum problem by active membranes. New Generation Computing (to appear)

    Google Scholar 

  10. Pérez-Jiménez, M.J., Riscos-Núñez, A.: A linear solution for the Knapsack problem using active membranes. In: Martín-Vide, C., Mauri, G., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2003. LNCS, vol. 2933, pp. 250–268. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  11. Pérez-Jiménez, M.J., Romero-Jiménez, A., Sancho-Caparrini, F.: A polynomial complexity class in P systems using membrane division. In: Csuhaj–Varjú, E., Kintala, C., Wotschke, D., Vaszyl, G. (eds.) Proceedings of the 5th Workshop on Descriptional Complexity of Formal Systems, Budapest, Hungary, pp. 284–294 (2003)

    Google Scholar 

  12. Pérez-Jiménez, M.J., Romero-Jiménez, A., Sancho-Caparrini, F.: Solving VALIDITY problem by active membranes with input. In: M. Cavaliere, C. Martín-Vide, and Gh. Păun (eds), Proceedings of the Brainstorming Week on Membrane Computing, Tarragona, Spain, Report RGML 26/03, pp. 279–290 (2003)

    Google Scholar 

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

    MATH  Google Scholar 

  14. Zandron, C.: A Model for Molecular Computing: Membrane Systems. Ph.D. Thesis, Università degli Studi di Milano (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gutiérrez-Naranjo, M.A., Pérez-Jiménez, M.J., Riscos-Núñez, A. (2005). On Descriptive Complexity of P Systems. In: Mauri, G., Păun, G., Pérez-Jiménez, M.J., Rozenberg, G., Salomaa, A. (eds) Membrane Computing. WMC 2004. Lecture Notes in Computer Science, vol 3365. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31837-8_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31837-8_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25080-7

  • Online ISBN: 978-3-540-31837-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics