Skip to main content
SpringerLink
Log in
Book cover

International Workshop on DNA-Based Computers

DNA 2002: DNA Computing pp 281–290Cite as

Unexpected Universality Results for Three Classes of P Systems with Symport/Antiport

  • Conference paper
  • First Online:

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

Abstract

Symport and antiport are biological ways of transporting molecules through membranes in “collaborating” pairs; in the case of symport the two molecules pass in the same direction, in the case of antiport the two molecules pass in opposite directions. Here we first survey the results about the computing power of membrane systems (P systems) using only symport/antiport rules (hence these systems compute only by using communication), then we introduce a novel way of defining the result of a computation in a membrane system: looking for the trace of certain objects in their movement through membranes. Rather unexpected, in this way we get characterizations of recursively enumerable languages by means of membrane systems with symport/antiport which work with multisets of objects (note the qualitative difference between the data structure used by computations - multisets: no ordering - and the data structure of the output - strings: linear ordering). A similar remark holds true for the case of analysing P systems: the sequence of certain distinguished objects taken from the environment during a computation is the string recognized by the computation. We also survey universality results from this area, with sketched proofs.

Corresponding author.

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. B. Alberts et al.: Essential Cell Biology. An Introduction to the Molecular Biology of the Cell. Garland Publ. Inc., New York, London, 1998.

    Google Scholar 

  2. I.I. Ardelean: The Relevance of Biomembranes for P Systems. Fundamenta Informaticae, 49, 1–3 (2002), 35–43.

    MATH  MathSciNet  Google Scholar 

  3. E. Csuhaj-Varju, G. Vaszil. P Automata. Pre-Proceedings of Workshop on Membrane Computing, Curtea de Argesş, Romania, 2002, MolCoNet Publication No. 1, 2002, 177–192.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  6. P. Frisco, H.J. Hoogeboom: Simulating Counter Automata by P Systems with Symport/Antiport. Pre-Proceedings of Workshop on Membrane Computing, Curtea de Argesş, Romania, 2002, MolCoNet Publication No. 1, 2002, 237–248.

    Google Scholar 

  7. M. Ionescu, C. Martín-Vide, Gh. Păun: P Systems with Symport/Antiport Rules: The Traces of Objects. Grammars, 5 (2002).

    Google Scholar 

  8. C. Martin-Vide, A. Păun, Gh. Păun: On the Power of P Systems with Symport Rules. Journal of Universal Computer Science, 8, 2 (2002), 317–331.

    MathSciNet  Google Scholar 

  9. C. Martin-Vide, A. Păun, Gh. Păun, G. Rozenberg: Membrane Systems with Coupled Transport: Universality and Normal Forms. Fundamenta Informaticae, 49, 1–3 (2002), 1–15.

    MATH  MathSciNet  Google Scholar 

  10. C. Martin-Vide, Gh. Păun: Elements of Formal Language Theory for Membrane Computing. Technical Report 21/01 of the Research Group on Mathematical Linguistics, Rovira i Virgili University, Tarragona, 2001.

    Google Scholar 

  11. A. Păun: Membrane Systems with Symport/Antiport: Universality Results. Pre-Proceedings of Workshop on Membrane Computing, Curtea de Argesş, Romania, 2002, MolCoNet Publication No. 1, 2002, 333–344.

    Google Scholar 

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

    Article  MATH  Google Scholar 

  13. A. Păun, Gh. Păun, G. Rozenberg: Computing by Communication in Networks of Membranes. International Journal of Fundamentals of Computer Science, to appear.

    Google Scholar 

  14. Gh. Păun: Computing withMembranes. Journal of Computer and System Sciences, 61, 1 (2000), 108–143

    Article  MATH  MathSciNet  Google Scholar 

  15. Gh. Păun: Computing with Membranes: An Introduction. Springer-Verlag, Berlin, 2002.

    Google Scholar 

  16. Gh. Păun, M. Perez-Jimenez, F. Sancho-Caparrini: On the Reachability Problem for P Systems with Porters. Proc. Automata and Formal Languages Conf., Debrecen, Hungary, 2002.

    Google Scholar 

  17. P. Sosik. P Systems Versus Register Machines: Two Universality Proofs. Pre-Proceedings of Workshop on Membrane Computing, Curtea de Argesş, Romania, 2002, MolCoNet Publication No. 1, 2002, 371–382.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics, University of Bucharest, Str. Academiei 14, 70109, Bucuresşti, Romania

    Mihai Ionescu

  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. Department of Computer Science, University of Western Ontario London, N6A 5B7, Ontario, Canada

    Andrei PĂun

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

    Gheorghe PĂun

Authors
  1. Mihai Ionescu
    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. Andrei PĂun
    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 Computer Science, University of Toyko Graduate School of Information Science and Technology, 7-3-1 Hongo, Bunkyo-ku, 113-8565, Tokyo, Japan

    Masami Hagiya

  2. Division of Complex Systems Technology, Hokkaido University Graduate School of Engineering, N-13, W-8, KITA-KU, 060, Sapporo, Japan

    Azuma Ohuchi

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ionescu, M., Martín-Vide, C., PĂun, A., PĂun, G. (2003). Unexpected Universality Results for Three Classes of P Systems with Symport/Antiport. In: Hagiya, M., Ohuchi, A. (eds) DNA Computing. DNA 2002. Lecture Notes in Computer Science, vol 2568. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36440-4_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-36440-4_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00531-5

  • Online ISBN: 978-3-540-36440-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation