Skip to main content

P Automata

  • Conference paper

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

Abstract

In this paper we discuss P automata, i.e., accepting P systems, using in most cases only communication rules. We briefly describe the most important variants of these systems and report on their important properties, with special emphasis on their computational power and size. We also propose some new topics and problems for future research.

Research supported in part by project “MolCoNet” IST-2001-32008 and the Hungarian Scientific Research Fund (OTKA) Grant No. T 042529.

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. Alhazov, A.: Minimizing Evolution-Communication P Systems and EC P Automata. In: Cavaliere, M., Martín-Vide, C., Păun, G. (eds): Brainstorming Week on Membrane Computing, Technical Report 26/03 of the Research Group on Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain, 23–31 (2003)

    Google Scholar 

  2. Bel-Enguix, G., Gramatovici, R.: Active P Automata and Natural Language Processing. In: Alhazov, A., Martín-Vide, C., Păun, Gh. (eds.): Workshop on Membrane Computing, WMC 2003, Tarragona, July 17-22, 2003. Technical Report 28/03 of the Research Group on Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain, 61–71 (2003)

    Google Scholar 

  3. Bel-Enguix, G., Gramatovici, R.: Parsing with Active P Automata. In: Martín-Vide, C., Mauri, G., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2003. LNCS, vol. 2933, pp. 203–217. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  4. Csuhaj-Varjú, E., Ibarra, O.H., Vaszil, G.: On the Computational Complexity of P Automata. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) Preliminary Proceedings of DNA10. Tenth International Meeting on DNA Computing, Milan. University of Milano-Bicocca, Italy, June 7-10, 2004, pp. 97–106 (2004)

    Google Scholar 

  5. Csuhaj-Varjú, E., Vaszil, G.: P Automata. In: Păun, G., Zandron, C. (eds.) Pre-Proceedings of the Workshop on Membrane Computing WMC-CdeA 2002, Curtea de Argeş, Romania, August 19-23, 2002, pp. 177–192 (2002) Pub. No. 1 of MolCoNet-IST-2001-32008, 2002, 177–192

    Google Scholar 

  6. Csuhaj-Varjú, E., Vaszil, G.: P Automata. In: Păun, Gh., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC 2002. LNCS, vol. 2597, pp. 219–233. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  7. Freund, R., Kari, L., Oswald, M., Sosik, P.: Computationally Universal P Systems without Priorities: Two Catalysts Are Sufficient. Theoretical Computer Science (to appear)

    Google Scholar 

  8. Freund, R., Martín-Vide, C., Obtułowicz, A., Păun, G.: On Three Classes of Automata-like P Systems. In: Ésik, Z., Fülöp, Z. (eds.) DLT 2003. Proceedings. Lecture Notes in Computer Science, vol. 2710, pp. 292–303. Springer, Berlin (2003)

    Google Scholar 

  9. Freund, R., Oswald, M.: A Short Note on Analysing P Systems. Bulletin of the EATCS 78, 231–236 (2002)

    MATH  MathSciNet  Google Scholar 

  10. Freund, R., Oswald, M.: P Systems with Conditional Communication Rules Assigned to Membranes. In: Alhazov, A., Martín-Vide, C., Păun, Gh. (eds.): Workshop on Membrane Computing, WMC-2003, Tarragona, July 17-22, Technical Report 28/03 of the Research Group on Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain, 231–240 (2003)

    Google Scholar 

  11. Freund, R., Oswald, M., Sosik, P.: Reducing the Number of Catalysts Needed in Computationally Universal Systems without Priorities. In: Csuhaj-Varjú, E., Kintala, C., Wotschke, D., Vaszil, G. (eds.) Fifth International Worskhop Descriptional Complexity of Formal Systems. MTA SZTAKI, Budapest, pp. 102–113 (2003)

    Google Scholar 

  12. Freund, R., Oswald, M., Staiger, L.: ω-P Automata with communication rules. In: Martín-Vide, C., Mauri, G., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2003. LNCS, vol. 2933, pp. 203–217. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  13. Ibarra, O.H.: The Number of Membranes Matters. In: Martín-Vide, C., Mauri, G., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2003. LNCS, vol. 2933, pp. 218–231. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  14. Ibarra, O.H.: On the Computational Complexity of Membrane Systems. To appear in Theoretical Computer Science

    Google Scholar 

  15. Madhu, M., Krithivasan, K.: On a Class of P Automata. Intern. J. Computer Math. 80(9), 1111–1120 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  16. Martín-Vide, C., Păun, G., Pazos, J., Rodrígez-Patón, A.: Tissue P Systems. Theoretical Computer Science 296(2), 295–326 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  17. Oswald, M.: P Automata. PhD dissertation, Technical University of Vienna (2003)

    Google Scholar 

  18. Oswald, M., Freund, R.: P Automata with Membrane Channels. In: Sugisaka, M., Tanaka, H. (eds.) Proc. of the Eight Int. Symp. on Artificial Life and Robotics, Beppu, Japan, pp. 275–278 (2003)

    Google Scholar 

  19. Păun, G.: Computing with Membranes. TUCS Report 208, Turku Centre for Computer Science (1998)

    Google Scholar 

  20. Păun, G.: Computing with Membranes. An Introduction. Bulletin of the EATCS 67, 139–152 (1999)

    MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  22. Păun, G.: Computing with Membranes (P Systems): Twenty six research topics. CDMTCS Technical Report 119, Univ. of Auckland (2000)

    Google Scholar 

  23. Păun, G.: Membrane Computing. An Introduction. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  24. Păun, G., Rozenberg, G.: A Guide to Membrane Computing. Theoretical Computer Science 287, 73–100 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  25. The P systems web page at http://psystems.disco.unimib.it

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

Csuhaj-Varjú, E. (2005). P Automata. 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_2

Download citation

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

  • 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