Universality Results for Some Variants of P Systems
P systems, introduced by Gh. PĂun, form a new class of distributed computing models. Many variants of P systems were shown to be computationally universal. In this paper, we consider several classes of P systems with symbol-objects where we allow the catalysts to move in and out of a membrane. We prove universality results for these variants of P systems with a very small number of membranes.
Unable to display preview. Download preview PDF.
- 1.J. Dassow, Gh. Păun, Regulated Rewriting in Formal Language Theory, Springer-Verlag, Berlin, 1989.Google Scholar
- 2.R. Freund, C. Martin-Vide, Gh. Păun, Computing with membranes: Three morecollapsing hierarchies, submitted, 2000.Google Scholar
- 3.R. Freund, Gh. Păun, On the number of nonterminals in graph-controlled, programmed,and matrix grammars, Proc. of MCU Conf.. Chisinău, Moldova, 2001.Google Scholar
- 4.M. Ito, C. Martin-Vide, Gh. Păun, A characterization of Parikh sets of ET0Llanguages in terms of P systems, in vol. Words, Semigroups, Transducers (M. Ito, Gh. Păun, S. Yu, eds.), World Scientific, Singapore, 2001, in press.Google Scholar
- 5.S.N. Krishna, Computing with simple P systems, Workshop on Multiset Processing,Curtea de Argesc Romania, 2000.Google Scholar
- 6.M. Madhu, K. Krithivasan, P systems with membrane creation: Universality andeficiency, Proc. of MCU Conf.. Chisinău, Moldova, 2001.Google Scholar
- 10.Gh. Păun, Computing with membranes: Attacking NP-complete problems, Unconventional Models of Computation-UMC2K ( I. Antoniou, C. S. Calude, M. J. Dinneen, eds.), Springer-Verlag, London, 2000, 94–115.Google Scholar
- 11.Gh. Păun, Computing with membranes (P systems): Twenty six research topics,Auckland University, CDMTCS Report No 119, 2000. (http://www.cs.auckland.ac.nz/CDMTCS).