Parsing with Active P Automata

  • Gemma Bel-Enguix
  • Radu Gramatovici
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2933)

Abstract

New classes of P automata are introduced corresponding to the basic classes of languages in the Chomsky hierarchy. Unlike the previously defined P automata, active P automata are computing with the structure of the membrane systems, using operations like membrane creation, division and dissolution. The model is applied to the parsing of (natural language) sentences into dependency trees.

Keywords

Turing Machine Current Membrane Regular Language Mathematical Linguistics Dependency Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

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 in Membrane Computing, Technical Report 26/03, Universitat Rovira i Virgili, Tarragona, pp. 23–31 (2003)Google Scholar
  2. 2.
    Bel-Enguix, G.: Preliminaries About Some Possible Applications of P Systems in Linguistics. In: Păun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC 2002. LNCS, vol. 2597, pp. 74–89. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  3. 3.
    Csuhaj-Varjú, E., Vaszil, G.: P Automata or Purely Communicating Accepting P Systems. In: Păun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC 2002. LNCS, vol. 2597, pp. 219–233. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  4. 4.
    Csuhaj-Varjú, E., Vaszil, G.: New Results and Research Directions Concerning P Automata, Accepting P Systems with Communication Only. In: Tarragona, M., Cavaliere, C., Păun, G. (eds.) Brainstorming Week in Membrane Computing, Technical Report 26/03, Universitat Rovira i Virgili, Tarragona, pp. 171–179 (2003)Google Scholar
  5. 5.
    Freund, R., Oswald, M.: A Short Note on Analyzing P Systems with Antiport Rules. Bulletin of the EATCS 78, 231–236 (2002)MATHMathSciNetGoogle Scholar
  6. 6.
    Freund, R., Martín-Vide, C., Obtulowicz, A.: On Three Classes of Automata-Like P Systems. In: Ésik, Z., Fülöp, Z. (eds.) DLT 2003. LNCS, vol. 2710. Springer, Heidelberg (2003) (to appear)CrossRefGoogle Scholar
  7. 7.
    Gladkij, A.V.: On Describing the Syntactic Structure of a Sentence (in Russian). Computational Linguistics 7, Budapest (1968)Google Scholar
  8. 8.
    Gramatovici, R.: On the Recognizing Power of Non-Expansive Iterated Go-Through Automata (2003) (to appear)Google Scholar
  9. 9.
    Kahane, S.: Bubble Trees and Syntactic Representations. In: Becker, T., Krieger, H.-U. (eds.) Proceedings of Mathematics of Language (MOL5) Meeting, DFKI, Saarbrucken, pp. 70–76 (1997)Google Scholar
  10. 10.
    Kahane, S.: A Fully Lexicalized Grammar for French Based on Meaning-Text Theory. In: Gelbukh, A. (ed.) CICLing 2001. LNCS, vol. 2004, pp. 18–31. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  11. 11.
    Krithivasan, K.: P Automata with Tapes. In: Tarragona, M., Cavaliere, C., Păun, G. (eds.) Brainstorming Week in Membrane Computing, Technical Report 26/03, Universitat Rovira i Virgili, Tarragona, pp. 216–225 (2003)Google Scholar
  12. 12.
    Madhu, M., Krithivasan, K.: On a Class of P Automata (2003) (submitted)Google Scholar
  13. 13.
    Manea, F.: Contextual Grammars and Go Through Automata. In: ten Cate, B. (ed.) Proceedings of the ESSLLI 2003 Student Session, Vienna, Austria, pp. 159–168 (2003)Google Scholar
  14. 14.
    Marcus, S.: Bridging P Systems and Genomics: A Preliminary Approach. In: Păun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC 2002. LNCS, vol. 2597, pp. 371–376. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  15. 15.
    Păun, G.: Membrane Computing. An Introduction. Springer, Berlin (2002)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Gemma Bel-Enguix
    • 1
    • 2
  • Radu Gramatovici
    • 3
  1. 1.Research Group on Mathematical LinguisticsRovira i Virgili UniversityTarragonaSpain
  2. 2.Department of Computer ScienceUniversity of Milan-BicoccaMilanItaly
  3. 3.Faculty of Mathematics and Computer ScienceUniversity of BucharestBucharestRomania

Personalised recommendations