Skip to main content
SpringerLink
Log in
Book cover

International Conference on Developments in Language Theory

DLT 2003: Developments in Language Theory pp 292–303Cite as

On Three Classes of Automata-Like P Systems

  • Conference paper
  • First Online:

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

Abstract

We investigate the three classes of accepting P systems considered so far, namely the P automata of Csuhaj-Varjú, Vaszil [3], their variant introduced by Madhu, Krithivasan [10], and the related machinery of Freund, Oswald [5]. All three variants of automata-like P systems are based on symport/antiport rules. For slight variants of the first two classes we prove that any recursively enumerable language can be recognized by systems with only two membranes (this considerably improves the result from [3], where systems with seven membranes were proved to be universal). We also introduce the initial mode of accepting strings (the strings are introduced into the system, symbol by symbol, at the beginning of a computation), and we briefly investigate this mode for the three classes of automata, especially for languages over a one-letter alphabet. Some open problems are formulated, too.

Work done in the framework of the Contract No ICA1-CT-2000-70024 between IM-PAN, Warsaw, Poland, and the European Community and under the Fifth Framework Programme, project “MolCoNet” IST-2001-32008

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bernardini, F., Manca, V.: P Systems with Boundary Rules. In: Rozenberg, G., Salomaa, A., Zandron, C. (eds.): Membrane Computing 2002. LNCS, Vol. 2597. Springer-Verlag, Berlin Heidelberg New York (2003) [14] 107–118

    Chapter  Google Scholar 

  2. Csuhaj-Varjú, E., Martín-Vide, C., Mitrana, V.: Multiset Automata. In: Calude, C.S., Păun, Gh., Rozenberg, G., Salomaa, A. (eds.): Multiset Processing. LNCS, Vol. 2235. Springer-Verlag, Berlin Heidelberg New York (2001) 69–84

    Chapter  Google Scholar 

  3. Csuhaj-Varjú, E., Vaszil, G.: P Automata. In: Rozenberg, G., Salomaa, A., Zandron, C. (eds.): Membrane Computing 2002. LNCS, Vol. 2597. Springer-Verlag, Berlin Heidelberg New York (2003) [14] 219–233

    Chapter  Google Scholar 

  4. Freund, R., Oswald, M.: P Systems with Activated/Prohibited Membrane Channels. In: Rozenberg, G., Salomaa, A., Zandron, C. (eds.): Membrane Computing 2002. LNCS, Vol. 2597. Springer-Verlag, Berlin Heidelberg New York (2003) [14] 261–269

    Chapter  Google Scholar 

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

    MathSciNet  Google Scholar 

  6. Freund, R., Păun, A.: Membrane Systems with Symport/Antiport: Universality Results. In: Rozenberg, G., Salomaa, A., Zandron, C. (eds.): Membrane Computing 2002. LNCS, Vol. 2597. Springer-Verlag, Berlin Heidelberg New York (2003) [14] 270–287

    Chapter  Google Scholar 

  7. Freund, R., Păun, Gh.: On the Number of Non-terminal Symbols in Graph-controlled, Programmed and Matrix Grammars. In: Margenstern, M., Rogozhin, Y. (eds.): Proc. Conf. Universal Machines and Computations, Chişinău, 2001. LNCS, Vol. 2055. Springer-Verlag, Berlin Heidelberg New York (2001) 214–225

    Chapter  Google Scholar 

  8. Freund, R., Sosík, P.: P Systems without Priorities Are Computationally Universal. In: Rozenberg, G., Salomaa, A., Zandron, C. (eds.): Membrane Computing 2002. LNCS, Vol. 2597. Springer-Verlag, Berlin Heidelberg New York (2003) [14] 400–409

    Google Scholar 

  9. Frisco, P., Hoogeboom, H.J.: Simulating Counter Automata by P Systems with Symport/Antiport. In: Rozenberg, G., Salomaa, A., Zandron, C. (eds.): Membrane Computing 2002. LNCS, Vol. 2597. Springer-Verlag, Berlin Heidelberg New York (2003) [14] 288–301

    Chapter  Google Scholar 

  10. Madhu, M., Krithivasan, K.: On a Class of P Automata, manuscript (2002)

    Google Scholar 

  11. Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice Hall, Englewood Cliffs, New Jersey, USA (1967)

    MATH  Google Scholar 

  12. Păun, A., Păun, Gh.: The Power of Communication: P Systems with Symport/Antiport. New Generation Computing 20,3 (2002) 295–306

    Article  MATH  Google Scholar 

  13. Păun, Gh.: Membrane Computing: An Introduction. Springer-Verlag, Berlin Heidelberg New York (2002)

    MATH  Google Scholar 

  14. Păun, Gh, Rozenberg, G., Salomaa, A., Zandron, C. (eds.): Membrane Computing 2002. LNCS, Vol. 2597. Springer-Verlag, Berlin Heidelberg New York (2003)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Technische Universität Wien, Karlsplatz 13, A-1040, Wien, Austria

    Rudolf Freund

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

    Carlos Martín-Vide & Gheorghe Păun

  3. Institute of Mathematics of the Polish Academy of Sciences, Śniadeckich 8, PO Box 137, 00-950, Warsaw, Poland

    Adam Obtułowicz

  4. Institute of Mathematics of the Romanian Academy, PO Box 1-764, 70700, Bucureşti, Romania

    Gheorghe Păun

Authors
  1. Rudolf Freund
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Carlos Martín-Vide
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Adam Obtułowicz
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Gheorghe Păun
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics, University of Szeged, Árpád tér 2, 6720, Szeged, Hungary

    Zoltán Ésik  & Zoltán Fülöp  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Freund, R., Martín-Vide, C., Obtułowicz, A., Păun, G. (2003). On Three Classes of Automata-Like P Systems. In: Ésik, Z., Fülöp, Z. (eds) Developments in Language Theory. DLT 2003. Lecture Notes in Computer Science, vol 2710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45007-6_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-45007-6_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40434-7

  • Online ISBN: 978-3-540-45007-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation