Look-Ahead Evolution for P Systems
- 371 Downloads
This article introduces a new derivation mode for P systems. This mode permits to evaluate next possible configurations and to discard some of them according to forbidding conditions. The interesting point is that the software implementation of this mode needs very small modifications to the standard algorithm of rule assignment for maximal parallelism. The introduced mode has numerous advantages with respect to the maximally parallel mode, the most important one being that some non-deterministic proofs become deterministic. As an example we present a generalized communicating P system that accepts 2 n in n steps in a deterministic way. Another example shows that in the deterministic case this mode is strictly more powerful than the maximally parallel derivation mode. Finally, this mode gives a natural way to define P systems that may accept or reject a computation.
Unable to display preview. Download preview PDF.
- 1.Alhazov, A., Rogozhin, Y., Verlan, S.: Symport/antiport tissue P systems with minimal cooperation. In: Proc. ESF Exploratory Workshop on Cellular Computing (Complexity Aspects), Sevilla, Spain, pp. 37–52Google Scholar
- 4.Csuhaj-Varjú, E.: P automata. In: Mauri, G., Păun, G., Jesús Pérez-Jímenez, M., Rozenberg, G., Salomaa, A. (eds.) WMC 2004. LNCS, vol. 3365, pp. 19–35. Springer, Heidelberg (2005)Google Scholar
- 6.Freund, R., Kogler, M., Verlan, S.: P automata with controlled use of minimal communication rules. In: Bordihn, H., et al. (eds.) Proc. of Workshop on Non-Classical Models for Automata and Applications, Wroclaw, Poland, pp. 107–119 (2009)Google Scholar
- 8.Oswald, M.: P Automata. PhD thesis. Vienna Univ. of Technology (2003)Google Scholar
- 13.The Membrane Computing Web Page, http://ppage.psystems.eu