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.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This work was possible thanks to a research grant Beca URV from Rovira i Virgili University.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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.
J. Dassow, G. Păun, Regulated Rewriting in Formal Language Theory, Springer-Verlag, Berlin, 1989.
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.
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.
G. Păun, Membrane Computing. An Introduction, Springer-Verlag, Berlin, Heidelberg, 2002.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cavaliere, M. (2003). Evolution–Communication P Systems. 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_10
Download citation
DOI: https://doi.org/10.1007/3-540-36490-0_10
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