Skip to main content
SpringerLink
Log in
Book cover

Workshop on Membrane Computing

WMC 2002: Membrane Computing pp 288–301Cite as

Simulating Counter Automata by P Systems with Symport/Antiport

  • Conference paper
  • First Online:

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

Abstract

The complexity, expressed in number of membranes and weight of rules, of Psystems with symport/antiport generating recursively enumerable sets is reduced if counter automata instead of matrix grammars are simulated. We consider both subsets of N obtained by counting objects in a designated membrane, and string languages obtained by following the traces of a designated object.

Work partially supported by contribution of EU commission 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. Bibliography of P Systems, at: The P Systems Web Page, C. Zandron (Ed.), http://psystems.disco.unimib.it

  2. E. Csuhaj-Varjú, G. Vaszil. PAutomata, in [PZ02], pages 177–192.

    Google Scholar 

  3. R. Freund, M. Oswald. PSystems with Activated/Prohibited Membrane Channels, this volume.

    Google Scholar 

  4. R. Freund, Gh. Păun. On the Number of Non-terminals in Graph-controlled, Programmed, and Matrix Grammars, in [MR01], pages 214–225.

    Google Scholar 

  5. H. J. Hoogeboom. Carriers and Counters; Psystems with Carriers vs. (Blind) Counter Automata, in: M. Ito, M. Toyama (eds.) Developments in Language Theory 2002, Preproceedings, 2002, pages 255–268. Updated paper to appear in LNCS.

    Google Scholar 

  6. J. E. Hopcroft, J. D. Ullman. Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, 1979.

    Google Scholar 

  7. M. Ionescu, C. Martín-Vide, A. Păun, Gh. Păun. Membrane Systems with Symport/Antiport: (Unexpected) Universality Results, in: M. Hagiya, A. Ohuchi (eds.) Preliminary Proceedings 8th International Meeting on DNA Based Computers, 2002, pages 151–160.

    Google Scholar 

  8. M. Margenstern, Y. Rogozhin (eds.) Procedings Universal Computational Models, Chişinău, Lecture Notes in Computer Science, Volume 2055, Springer Verlag, 2001.

    Google Scholar 

  9. C. Martín-Vide, Gh. Păun. Computing with Membranes (PSystems): Universality Results, in [MR01], pages 214–225.

    Google Scholar 

  10. C. Martín-Vide, A. Păun, Gh. Păun. On the Power of P Systems with Symport Rules. Journal of Universal Computer Science 8 (2002), pages 317–331.

    Google Scholar 

  11. C. Martín-Vide, A. Păun, Gh. Păun, G. Rozenberg. Membrane Systems with Coupled Transport: Universality and Normal Forms. Fundamenta Informaticae 49 (2002), pages 1–15.

    MathSciNet  MATH  Google Scholar 

  12. M. L. Minsky. Recursive Unsolvability of Post’s Problem of “Tag▸ and Other Topics in Theory of Turing Machines. Annals of Mathematics, 74 (1961), pages 437–455.

    Article  MathSciNet  MATH  Google Scholar 

  13. A. Păun. Membrane Systems with Symport/Antiport. Universality Results, in [PZ02], pages 333–343.

    Google Scholar 

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

    Article  MATH  Google Scholar 

  15. Gh. Păun. Computing with Membranes. Journal of Computer and System Sciences, 61 (2000), pages 108–143.

    Article  MathSciNet  MATH  Google Scholar 

  16. Gh. Păun. Computing with Membranes (PSystems): Twenty Six Research Topics, CDMTCS TR 119, Univ. of Auckland, 2000. http://www.cs.auckland.ac.nz/CDMTCS/

  17. Gh. Păun. Membrane Computing. An Introduction. Natural Computing Series, Springer Verlag, 2002.

    Google Scholar 

  18. Gh. Păun, G. Rozenberg. A Guide to Membrane Computing. Theoretical Computer Science, 287 (2002), pages 73–100.

    Article  MathSciNet  MATH  Google Scholar 

  19. Gh Păun, C. Zandron (eds.) Pre-proceedings of the Second Workshop on Membrane Computing, Curtea de Argeş Romania, Molconet Publication 1, 2002. Updated papers to appear in LNCS, this volume.

    Google Scholar 

  20. P. Sosík, P Systems Versus Register Machines: Two Universality Proofs, in [PZ02], pages 371–382.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Advanced Computer Science, Universiteit Leiden, The Netherlands

    Pierluigi Frisco & Hendrik Jan Hoogeboom

Authors
  1. Pierluigi Frisco
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hendrik Jan Hoogeboom
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Mathematics of the Romanian Academy, P.O. Box 1-764, 70700, Bucharest, Romania

    Gheorghe PĂun

  2. Leiden University, Leiden Institute of Advanced Computer Science, Niels Bohrweg 1, 2333, CA Leiden, The Netherlands

    Grzegorz Rozenberg

  3. Turku Centre for Computer Science, Lemminkäisenkatu 14A, 20520, Turku, Finland

    Arto Salomaa

  4. Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano-Bicocca, Via Bicocca degli Arcimboldi, 8, 20126, Milano, Italy

    Claudio Zandron

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Frisco, P., Hoogeboom, H.J. (2003). Simulating Counter Automata by P Systems with Symport/Antiport. In: PĂun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds) Membrane Computing. WMC 2002. Lecture Notes in Computer Science, vol 2597. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36490-0_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-36490-0_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00611-4

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation