Abstract
We consider the idea of controlling the evolution of a membrane system. In particular, we investigate a model of membrane systems using promoted rules, where a string of promoters (called the control string) “travels” through the regions, activating the rules of the system. This control string is present in the skin region at the beginning of the computation – one can interpret that it has been inserted in the system before starting the computation – and it is “consumed”, symbol by symbol, while traveling through the system. In this way, the inserted string drives the computation of the membrane system by controlling the activation of evolution rules. When the control string is entirely consumed and no rule can be applied anymore, then the system halts – this corresponds to a successful computation. The number of objects present in the output region is the result of such a computation. In this way, using a set of control strings (a control program), one generates a set of numbers. We also consider a more restrictive definition of a successful computation, and then study the corresponding model.
In this paper we investigate the influence of the structure of control programs on the generative power. We demonstrate that different structures yield generative powers ranging from finite to recursively enumerable number sets.
In determining the way that the control string moves through the regions, we consider two possible “strategies of traveling”, and prove that they are similar as far as the generative power is concerned.
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
Bottoni, P., Martí-Vide, C., Păun, G., Rozenberg, G.: Membrane Systems with Promoters/Inhibitors. Acta Informatica 38(10), 695–720 (2002)
Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. Springer, Berlin (1989)
Freund, R., Kari, L., Oswald, M., Sosik, P.: Computationally Universal P Systems without Priorities: Two Catalysts are Sufficient. Theoretical Computer Science 330(2), 251–266 (2005)
Ginsburg, S., Rozenberg, G.: T0L Schemes and Control Sets. Information and Control 27, 109–125 (1974)
Ionescu, M., Sburlan, D.: On P Systems with Promoters/Inhibitors. Journal of Universal Computer Science 10(5), 581–599 (2004)
Păun, G.: Membrane Computing. An Introduction. Springer, Berlin (2002)
Păun, G., Rozenberg, G.: A Guide to Membrane Computing. Theoretical Computer Science 287(1), 73–100 (2002)
Rozenberg, G., Salomaa, A.: The Mathematical Theory of L Systems. Academic Press, Inc., Orlando (1980)
Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Berlin (1997)
Salomaa, A.: Formal Languages. Academic Press, New York (1973)
P systems web page: http://psystems.disco.unimib.it/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brijder, R., Cavaliere, M., Riscos-Núñez, A., Rozenberg, G., Sburlan, D. (2006). Membrane Systems with External Control. In: Hoogeboom, H.J., Păun, G., Rozenberg, G., Salomaa, A. (eds) Membrane Computing. WMC 2006. Lecture Notes in Computer Science, vol 4361. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11963516_14
Download citation
DOI: https://doi.org/10.1007/11963516_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69088-7
Online ISBN: 978-3-540-69090-0
eBook Packages: Computer ScienceComputer Science (R0)