Skip to main content
SpringerLink
Log in

Parsing with Active P Automata

  • Conference paper
Membrane Computing (WMC 2003)

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

Included in the following conference series:

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.

The research of the first author has been supported by Marie Curie Fellowships of the European Community programme Human Potential (IHP) under contract number HPMF-CT-2002-01582. The research of the second author has been supported by a fellowship from the NATO Scientific Committee in Spain.

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. 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. 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)

    Chapter  Google Scholar 

  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)

    Chapter  Google Scholar 

  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. Freund, R., Oswald, M.: A Short Note on Analyzing P Systems with Antiport Rules. Bulletin of the EATCS 78, 231–236 (2002)

    MATH  MathSciNet  Google Scholar 

  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)

    Chapter  Google Scholar 

  7. Gladkij, A.V.: On Describing the Syntactic Structure of a Sentence (in Russian). Computational Linguistics 7, Budapest (1968)

    Google Scholar 

  8. Gramatovici, R.: On the Recognizing Power of Non-Expansive Iterated Go-Through Automata (2003) (to appear)

    Google Scholar 

  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. 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)

    Chapter  Google Scholar 

  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. Madhu, M., Krithivasan, K.: On a Class of P Automata (2003) (submitted)

    Google Scholar 

  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. 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)

    Chapter  Google Scholar 

  15. Păun, G.: Membrane Computing. An Introduction. Springer, Berlin (2002)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Group on Mathematical Linguistics, Rovira i Virgili University, Pl. Imperial Tárraco 1, 43005, Tarragona, Spain

    Gemma Bel-Enguix

  2. Department of Computer Science, University of Milan-Bicocca, Via Bicocca degli Arcimboldi 8, 20136, Milan, Italy

    Gemma Bel-Enguix

  3. Faculty of Mathematics and Computer Science, University of Bucharest, Academiei 14, RO-010014, Bucharest, Romania

    Radu Gramatovici

Authors
  1. Gemma Bel-Enguix
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Radu Gramatovici
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Group in Mathematical Linguistics, Rovira i Virgili University, Pça, Imperial Tarraco 1, 43005, Tarragona, Spain

    Carlos Martín-Vide

  2. Complex Systems and Artificial Intelligence Research Center, University of Milan–Bicocca, Italy

    Giancarlo Mauri

  3. Institute of Mathematics of the Romanian Academy, PO Box 1-764, 014700, BucureÅŸti, Romania

    Gheorghe Păun

  4. Leiden Center of Advanced Computer Science (LIACS), Leiden University, Niels Bohrweg 1, 2333, Leiden, CA, The Netherlands

    Grzegorz Rozenberg

  5. Turku Centre for Computer Science (TUCS), Leminkäisenkatu 14, 20520, Turku, Finland

    Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bel-Enguix, G., Gramatovici, R. (2004). Parsing with Active P Automata. In: Martín-Vide, C., Mauri, G., Păun, G., Rozenberg, G., Salomaa, A. (eds) Membrane Computing. WMC 2003. Lecture Notes in Computer Science, vol 2933. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24619-0_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24619-0_3

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation