Membrane Systems with External Control

  • Robert Brijder
  • Matteo Cavaliere
  • Agustín Riscos-Núñez
  • Grzegorz Rozenberg
  • Dragoş Sburlan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4361)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bottoni, P., Martí-Vide, C., Păun, G., Rozenberg, G.: Membrane Systems with Promoters/Inhibitors. Acta Informatica 38(10), 695–720 (2002)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. Springer, Berlin (1989)Google Scholar
  3. 3.
    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)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Ginsburg, S., Rozenberg, G.: T0L Schemes and Control Sets. Information and Control 27, 109–125 (1974)CrossRefMathSciNetGoogle Scholar
  5. 5.
    Ionescu, M., Sburlan, D.: On P Systems with Promoters/Inhibitors. Journal of Universal Computer Science 10(5), 581–599 (2004)MathSciNetGoogle Scholar
  6. 6.
    Păun, G.: Membrane Computing. An Introduction. Springer, Berlin (2002)MATHGoogle Scholar
  7. 7.
    Păun, G., Rozenberg, G.: A Guide to Membrane Computing. Theoretical Computer Science 287(1), 73–100 (2002)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Rozenberg, G., Salomaa, A.: The Mathematical Theory of L Systems. Academic Press, Inc., Orlando (1980)MATHGoogle Scholar
  9. 9.
    Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Berlin (1997)MATHGoogle Scholar
  10. 10.
    Salomaa, A.: Formal Languages. Academic Press, New York (1973)MATHGoogle Scholar
  11. 11.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Robert Brijder
    • 1
  • Matteo Cavaliere
    • 2
    • 3
  • Agustín Riscos-Núñez
    • 3
  • Grzegorz Rozenberg
    • 1
  • Dragoş Sburlan
    • 3
    • 4
  1. 1.Leiden Institute of Advanced Computer Science (LIACS)Universiteit LeidenLeidenThe Netherlands
  2. 2.Centre for Computational and Systems BiologyMicrosoft Research – University of TrentoTrentoItaly
  3. 3.Dept. of Computer Science and Artificial IntelligenceUniversity of SevilleSevilleSpain
  4. 4.Faculty of Mathematics and InformaticsOvidius UniversityConstantzaRomania

Personalised recommendations