Skip to main content

A Survey of Some Variants of P Systems

  • Conference paper
  • First Online:

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

Abstract

In this paper we give a brief survey of some variants of P systems and their computational capacity. An improvement of a known result about rewriting P systems with leftmost derivation is given. We also give the generalized definition for normal forms of rewriting P systems.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Ferretti, G. Mauri, Gh. Păun, C. Zandron, On three variants of P systems with string-objects, in Pre-proceedings of Workshop on Membrane Computing, Curtea de Argeş, Romania, August 2001, Technical Report 17/01 of Research Group on Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain, 2001, 63–76.

    Google Scholar 

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

    Google Scholar 

  3. R. Freund, Gh. Păun, On the number of non-terminals in graph-controlled, programmed, and matrix grammars, in Proc. of Third. Intern. Conf. on Machines, Computation, and Universality, Chişinău, Moldova, 2001 (M. Margenstern, Y. Rogozhin, eds.), LNCS 2055, Springer-Verlag, 2001, 214–225.

    Google Scholar 

  4. S.N. Krishna, K. Lakshmanan, R. Rama, Hybrid P systems, Romanian J. Information Science and Technology, 4, 1 (2001), 111–124.

    Google Scholar 

  5. S.N. Krishna, K. Lakshmanan, R. Rama, On the power of P systems with contextual rules, Fundamenta Informaticae, 49, 1–3 (2002), 167–178.

    MathSciNet  MATH  Google Scholar 

  6. M. Madhu, K. Krithivasan, P systems with membrane creation: Universality and efficiency, in Proc. of Third. Intern. Conf. on Machines, Computation, and Universality, Chişinău, Moldova, 2001 (M. Margenstern, Y. Rogozhin, eds.), LNCS 2055, Springer-Verlag, 2001, 276–287.

    Google Scholar 

  7. M. Madhu, K. Krithivasan, Contextual P systems, Fundamenta Informaticae, 49, 1–3 (2002), 179–189.

    MathSciNet  MATH  Google Scholar 

  8. M. Madhu, K. Krithivasan, Generalized normal forms for rewriting P systems, Acta Informatica, 38, 10 (2002), 721–734.

    Article  MathSciNet  MATH  Google Scholar 

  9. M. Madhu, K. Krithivasan, Hybrid P systems: Improved universality results, Third Intern. Conf. on Unconventional Models of Computation, Himeji, Japan, 2002.

    Google Scholar 

  10. M. Madhu, K. Krithivasan, Improved results about universality of P systems, Bulletin of the EATCS, 76 (2002), 162–168.

    MathSciNet  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  13. Gh. Păun, Marcus Contextual Grammars, Kluwer Academic Publ., 1997.

    Google Scholar 

  14. Gh. Păun, Computing with membranes, J. Computer System Sciences, 61 (2000), 108–143.

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

  16. Gh. Păun, Computing with membranes; Attaching NP-complete problems, in Unconventional Models of Computation (I. Antoniou, C.S. Calude, M.J. Dinneen, eds.), Springer-Verlag, 2000, 94–115.

    Google Scholar 

  17. Gh. Păun, P systems with active membranes: Attacking NP-complete problems, J. Automata, Languages and Combinatorics, 11 (2001), 75–90.

    Google Scholar 

  18. R. Rodriguez-Paton, On the universality of P systems with membrane creation, Bulletin of the EATCS, 74 (2001), 229–233.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Madhu, M., Krithivasan, K. (2003). A Survey of Some Variants of P Systems. In: PĂun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds) Membrane Computing. WMC 2002. Lecture Notes in Computer Science, vol 2597. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36490-0_24

Download citation

  • DOI: https://doi.org/10.1007/3-540-36490-0_24

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-36490-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics