Evolution–Communication P Systems

  • Matteo Cavaliere
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2597)

Abstract

We propose a new class of P systems that use simple evolution rules (classical evolution rules without communication targets) and symport/antiport rules (for communication).

This type of P system is realistic for (at least) three different reasons: we do not have target indications in the evolution rules, we use very simple symport/antiport rules to realize communication, and we do not need objects available in the environment at the beginning of a computation. Somewhat expected, this new variant is still universal. We prove the universality in two cases: when using catalytic rules (but only one catalyst), symport/antiport rules of weight one, and two membranes, and when we use three membranes, symport/antiport rules of weight one, and no catalyst. Especially the latter result is of interest, because the catalysts were used in most universality proofs for P systems with symbol-objects. Also new is the proof technique we use: we start from programmed grammars with unconditional transfer.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    F. Bernardini, V. Manca, P systems with boundary rules, Pre-proceedings of Workshop on Membrane Computing, WMC-CdeA2002 (G. Păun, C. Zandron, eds.), Curtea de Argeş, Romania, August 2002, 97–101.Google Scholar
  2. 2.
    J. Dassow, G. Păun, Regulated Rewriting in Formal Language Theory, Springer-Verlag, Berlin, 1989.Google Scholar
  3. 3.
    H. Fernau, F. Stephan: How powerful is unconditional transfer? When UT meets AC, Proceedings of the 3rd International Conference on Developments in Language Theory (S. Bozapalidis, ed.), 1997, 249–260.Google Scholar
  4. 4.
    P. Frisco, H. J. Hoogeboom, Simulating counter automata by P systems with symport/antiport, Pre-proceedings of Workshop on Membrane Computing, WMCCdeA2002 (G. Păun, C. Zandron, eds.), Curtea de Argeş, Romania, August 2002, 237–248.Google Scholar
  5. 5.
    G. Păun, Membrane Computing. An Introduction, Springer-Verlag, Berlin, Heidelberg, 2002.Google Scholar
  6. 6.
    P. Sosik, P systems versus register machines: two universality proofs, Preproceedings of Workshop on Membrane Computing, WMC-CdeA2002 (G. Păun, C. Zandron, eds.), Curtea de Argeş, Romania, August 2002, 371–382.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Matteo Cavaliere
    • 1
  1. 1.Research Group in Mathematical LinguisticsRovira i Virgili UniversityTarragonaSpain

Personalised recommendations