P Automata

  • Erzsébet Csuhaj-Varjú
Part of the Lecture Notes in Computer Science book series (LNCS, 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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. 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)CrossRefGoogle Scholar
  4. 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. 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. 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)CrossRefGoogle Scholar
  7. 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. 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. 9.
    Freund, R., Oswald, M.: A Short Note on Analysing P Systems. Bulletin of the EATCS 78, 231–236 (2002)MATHMathSciNetGoogle Scholar
  10. 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. 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. 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)CrossRefGoogle Scholar
  13. 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)CrossRefGoogle Scholar
  14. 14.
    Ibarra, O.H.: On the Computational Complexity of Membrane Systems. To appear in Theoretical Computer ScienceGoogle Scholar
  15. 15.
    Madhu, M., Krithivasan, K.: On a Class of P Automata. Intern. J. Computer Math. 80(9), 1111–1120 (2003)MATHCrossRefMathSciNetGoogle Scholar
  16. 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)MATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    Oswald, M.: P Automata. PhD dissertation, Technical University of Vienna (2003)Google Scholar
  18. 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. 19.
    Păun, G.: Computing with Membranes. TUCS Report 208, Turku Centre for Computer Science (1998)Google Scholar
  20. 20.
    Păun, G.: Computing with Membranes. An Introduction. Bulletin of the EATCS 67, 139–152 (1999)MATHGoogle Scholar
  21. 21.
    Păun, G.: Computing with Membranes. Journal of Computer and System Sciences 61(1), 108–143 (2000)MATHCrossRefMathSciNetGoogle Scholar
  22. 22.
    Păun, G.: Computing with Membranes (P Systems): Twenty six research topics. CDMTCS Technical Report 119, Univ. of Auckland (2000)Google Scholar
  23. 23.
    Păun, G.: Membrane Computing. An Introduction. Springer, Heidelberg (2002)MATHGoogle Scholar
  24. 24.
    Păun, G., Rozenberg, G.: A Guide to Membrane Computing. Theoretical Computer Science 287, 73–100 (2002)MATHCrossRefMathSciNetGoogle Scholar
  25. 25.
    The P systems web page at http://psystems.disco.unimib.it

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Erzsébet Csuhaj-Varjú
    • 1
  1. 1.Computer and Automation Research InstituteHungarian Academy of SciencesBudapestHungary

Personalised recommendations