Skip to main content
SpringerLink
Log in
Book cover

International Conference on Developments in Language Theory

DLT 2004: Developments in Language Theory pp 418–429Cite as

Tissue P Systems with Minimal Symport/Antiport

  • Conference paper

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

Abstract

We show that tissue P systems with symport/antiport having 3 cells and symport/antiport rules of minimal weight generate all recursively enumerable sets of numbers. Constructed systems simulate register machines and have purely deterministic behaviour. Moreover, only 2 symport rules are used and all symbols of any system are present in finite number of copies (except for symbols corresponding to registers of the machine). At the end of the article some open problems are formulated.

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. Alhazov, A., Margenstern, M., Rogozhin, V., Rogozhin, Y., Verlan, S.: Communicative P systems with minimal cooperation. In: Mauri, G., Paun, G., Perez-Jimenez, M., Rozenberg, G., Salomaa, A. (eds.) WMC 2004. LNCS, vol. 3365, pp. 161–177. Springer, Heidelberg (2005) ( In publication)

    Chapter  Google Scholar 

  2. Bernardini, F., Gheorghe, M.: On the power of minimal symport/airport. In: Amazov, A., Martin-Vide, C., Păun, G. (eds.) WMC 2003. LNCS, vol. 2933, pp. 72–83. Springer, Heidelberg (2003)

    Google Scholar 

  3. Bernardini, F., Păun, A.: Universality of minimal symport/antiport: Five membranes suffice. In: Martín-Vide, C., Mauri, G., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2003. LNCS, vol. 2933, pp. 43–54. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  4. Freund, R., Păun, A.: Membrane systems with symport/Antiport rules: Universality results. In: Păun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC 2002. LNCS, vol. 2597, pp. 270–287. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  5. Frisco, P.: About P systems with symport/antiport. In: G. P?aun, A. Riscos-Núñez, A. Romero-Jiménez, and F. Sancho-Caparrini, editors, Second Brainstorming Week on Membrane Computing, number TR 01/2004 in Technical report, pp. 224–236. University of Seville (2004)

    Google Scholar 

  6. Frisco, P., Hoogeboom, H.: Simulating counter automata by P systems with symport/antiport. In: Păun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC 2002. LNCS, vol. 2597, pp. 288–301. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  7. Kari, L., Martín-Vide, C., Păun, A.: On the universality of P systems with minimal symport/antiport rules. In: Jonoska, N., Păun, G., Rozenberg, G. (eds.) Aspects of Molecular Computing. LNCS, vol. 2950, pp. 254–265. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  8. Martín-Vide, C., Păun, A., Păun, G.: On the power of P systems with symport rules. Journal of Universal Computer Science 8(2), 317–331 (2002)

    MathSciNet  Google Scholar 

  9. Minsky, M.: Computations: Finite and Infinite Machines. Prentice Hall, Englewood Cliffts (1967)

    Google Scholar 

  10. Păun, A., Păun, G.: The power of communication: P systems with symport/antiport. New Generation Computing 20(3), 295–305 (2002)

    Article  MATH  Google Scholar 

  11. Păun, G.: Computing with membranes. Journal of Computer and System Sciences 1(61), 108–143 (1998); Also TUCS Report No. 208 (1998)

    Google Scholar 

  12. Păun, G.: Membrane Computing. An Introduction. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  13. Păun, G., Sakakibara, Y., Yokomori, T.: P systems on graphs of restricted forms. Publicationes Mathematicae 60 (2002)

    Google Scholar 

  14. Păun, G., Yokomori, T.: Membrane computing based on splicing. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 54, pp. 217–232. American Mathematical Society, Providence (1999)

    Google Scholar 

  15. Vaszil, G.: On the size of p systems with minimal symport/antiport. In: Mauri, G., Păun, G., Jesús Pérez-Jímenez, M., Rozenberg, G., Salomaa, A. (eds.) WMC 2004. LNCS, vol. 3365, pp. 422–431. Springer, Heidelberg (2004)

    Google Scholar 

  16. Zandron, C.: The P systems web page, http://psystems.disco.unimib.it/

Download references

Author information

Authors and Affiliations

  1. LITA, University of Metz, France

    Sergey Verlan

Authors
  1. Sergey Verlan
    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 Auckland, New Zealand

    Cristian S. Calude

  2. Computer Science, Institute of Information and Mathematical Sciences, Massey University Albany, Auckland, New Zealand

    Elena Calude

  3. Department of Computer Science, University of Auckland, Private Bag 92019, Auckland, New Zealand

    Michael J. Dinneen

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Verlan, S. (2004). Tissue P Systems with Minimal Symport/Antiport. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds) Developments in Language Theory. DLT 2004. Lecture Notes in Computer Science, vol 3340. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30550-7_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30550-7_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24014-3

  • Online ISBN: 978-3-540-30550-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation