Characterizations of Catalytic Membrane Computing Systems
We look at 1-region membrane computing systems which only use rules of the form Ca →Cv, where C is a catalyst, a is a noncatalyst, and v is a (possibly null) string of noncatalysts. There are no rules of the form a →v. Thus, we can think of these systems as “purely” catalytic. We consider two types: (1) when the initial configuration contains only one catalyst, and (2) when the initial configuration contains multiple (not necessarily distinct) catalysts. We show that systems of the first type are equivalent to communication-free Petri nets, which are also equivalent to commutative context-free grammars. They define precisely the semilinear sets. This partially answers an open question in . Systems of the second type define exactly the recursively enumerable sets of tuples (i.e., Turing machine computable). We also study an extended model where the rules are of the form q: (p, Ca →Cv) (where q and p are states), i.e., the application of the rules is guided by a finite-state control. For this generalized model, type (1) as well as type (2) with some restriction correspond to vector addition systems.
Keywordsmembrane computing catalytic system semilinear set vector addition system reachability problem
Unable to display preview. Download preview PDF.
- 1.Baker, H.G.: Rabin’s proof of the undecidability of the reachability set inclusion problem for vector addition systems. In: C.S.C. Memo 79, Project MAC, MIT (1973)Google Scholar
- 5.Esparza, J.: Petri nets, commutative context-free grammars, and basic parallel processes. In: Reichel, H. (ed.) FCT 1995. LNCS, vol. 965, pp. 221–232. Springer, Heidelberg (1995)Google Scholar
- 7.Freund, R., Oswald, M., Sosik, P.: Reducing the number of catalysts needed in computationally universal P systems without priorities. In: the 5th Descriptional Complexity of Formal Systems Workshop (DFCS), July 12-14, Budapest, Hungary (2003) Google Scholar
- 9.Hack, M.H.: The equality problem for vector addition systems is undecidable. In: C.S.C. Memo 121, Project MAC, MIT (1975)Google Scholar
- 20.van Leeuwen, J.: A partial solution to the reachability problem for vector addition systems. In: Andersson, S.I. (ed.) Analysis of Dynamical and Cognitive Systems. LNCS, vol. 888, pp. 303–309. Springer, Heidelberg (1995)Google Scholar