Skip to main content
SpringerLink
Log in

Implementation of Catalytic P Systems

  • Conference paper
Implementation and Application of Automata (CIAA 2004)

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

Included in the following conference series:

Abstract

Taking advantage of the weak determinism inherent to the simulation of deterministic register machines by catalytic P systems, we present an efficient implementation of such P systems.

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. Arroyo, F., Luengo, C., Baranda, A.V., de Mingo, L.F.: A software simulation of transition P systems in Haskell. In: [15], pp. 19–32

    Google Scholar 

  2. Ciobanu, G., Wenyuan, G.: P systems running on a cluster of computers. In: [9], pp. 123–139

    Google Scholar 

  3. Dang, Z., Egecioglu, O., Ibarra, O.H., Saxena, G.: Characterizations of catalytic membrane computing systems. In: Rovan, B., Vojtáš, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 480–489. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  4. Dassow, J., Păun, G.: On the power of membrane computing. Journal of Universal Computer Science 5(2), 33–49 (1999)

    MathSciNet  Google Scholar 

  5. Freund, R., Oswald, M.: GP systems with forbidding context. Fundamenta Informaticae 49(1-3), 81–102 (2002)

    MATH  MathSciNet  Google Scholar 

  6. Freund, R., Păun, G.: On the number of non-terminals in graph-controlled, programmed, and matrix grammars. In: Margenstern, M., Rogozhin, Y. (eds.) MCU 2001. LNCS, vol. 2055, pp. 214–225. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  7. Freund, R., Kari, L., Oswald, M., Sosík, P.: Computationally universal P systems without priorities: two catalysts are sufficient. To appear in Theoretical Computer Science. Preversion downloadable at [18]

    Google Scholar 

  8. Freund, R., Păun, G.: From regulated rewriting to computing with membranes: collapsing hierarchies. Theoretical Computer Science 312, 143–188 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  9. Martín-Vide, C., Mauri, G., Păun, G., Rozenberg, G., Salomaa, A. (eds.): WMC 2003. LNCS, vol. 2933. Springer, Heidelberg (2004)

    MATH  Google Scholar 

  10. Minsky, M.L.: Finite and Infinite Machines. Prentice Hall, Englewood Cliffs (1967)

    MATH  Google Scholar 

  11. Oswald, M.: P Automata. PhD thesis. Vienna University of Technology (2003)

    Google Scholar 

  12. Păun, G.: Computing with membranes. Journal of Computer and System Sciences 61(1), 108–143 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  13. Păun, G.: Computing with membranes: an introduction. Bulletin EATCS 67, 139–152 (1999)

    MATH  Google Scholar 

  14. Păun, G.: Membrane Computing: an Introduction. Springer, Berlin (2002)

    MATH  Google Scholar 

  15. Păun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.): Membrane Computing. In: Păun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC 2002. LNCS, vol. 2597. Springer, Heidelberg (2003)

    MATH  Google Scholar 

  16. Sosík, P., Freund, R.: P systems without priorities are computationally universal. In: [15], pp. 400–409

    Google Scholar 

  17. Syropoulos, A., Mamatas, E.G., Allilomes, P.C., Sotiriades, K.T.: A distributed simulation of transition P systems. In: [9], pp. 357–368

    Google Scholar 

  18. The P Systems Web Page, http://psystems.disco.unimib.it

Download references

Author information

Authors and Affiliations

  1. Faculty of Informatics, Vienna University of Technology, Favoritenstr. 9-11, A-1040, Wien, Austria

    Aneta Binder, Rudolf Freund, Georg Lojka & Marion Oswald

Authors
  1. Aneta Binder
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rudolf Freund
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Georg Lojka
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Marion Oswald
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Manitoba, R3T 2N2, Winnipeg, MB, Canada

    Michael Domaratzki

  2. Department of Mathematics, University of Turku, Finland

    Alexander Okhotin

  3. School of Computing, Queen’s University, K7L 3N6, Kingston, Ontario, Canada

    Kai Salomaa

  4. Department of Computer Science, University of Western Ontario, N6A 5B7, London, Ontario, Canada

    Sheng Yu

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Binder, A., Freund, R., Lojka, G., Oswald, M. (2005). Implementation of Catalytic P Systems. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds) Implementation and Application of Automata. CIAA 2004. Lecture Notes in Computer Science, vol 3317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30500-2_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30500-2_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24318-2

  • Online ISBN: 978-3-540-30500-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation