Abstract
We look at a 1-membrane catalytic P system with evolution rules of the form Ca →Cv or a →v, where C is a catalyst, a is a noncatalyst symbol, and v is a (possibly null) string representing a multiset of noncatalyst symbols. (Note that we are only interested in the multiplicities of the symbols.) A catalytic system can be regarded as a language acceptor in the following sense. Given an input alphabet Σ consisting of noncatalyst symbols, the system starts with an initial configuration wz, where w is a fixed string of catalysts and noncatalysts not containing any symbol in z, and \(z = a_1^{n_1} \ldots a_k^{n_k}\) for some nonnegative integers n 1, ..., n k , with { a 1 ...a k } ⊆ ∑. At each step, a maximal multiset of rules is nondeterministically selected and applied in parallel to the current configuration to derive the next configuration (note that the next configuration is not unique, in general). The string z is accepted if the system eventually halts.
It is known that a 1-membrane catalytic system is universal in the sense that any unary recursively enumerable language can be accepted by a 1-membrane catalytic system (even by purely catalytic systems, i.e., when all rules are of the form Ca →Cv ). A catalytic system is said to be deterministic if at each step, there is a unique maximally parallel multiset of rules applicable. It has been an open problem whether deterministic systems of this kind are universal. We answer this question negatively: We show that the membership problem for deterministic catalytic systems is decidable. In fact, we show that the Parikh map of the language ( \(\subseteq a_1^* \ldots a_k^*\) ) accepted by any deterministic catalytic system is a simple semilinear set which can be effectively constructed. Since nondeterministic 1-membrane catalytic system acceptors (with 2 catalysts) are universal, our result gives the first example of a variant of P systems for which the nondeterministic version is universal, but the deterministic version is not.
We also show that for a deterministic 1-membrane catalytic system using only rules of type Ca →Cv, the set of reachable configurations from a given initial configuration is an effective semilinear set. The application of rules of type a →v, however, is sufficient to render the reachability set non-semilinear. Our results generalize to multi-membrane deterministic catalytic systems. We also consider deterministic catalytic systems which allow rules to be prioritized and investigate three classes of such systems, depending on how priority in the application of the rules is interpreted. For these three prioritized systems, we obtain contrasting results: two are universal and one only accepts semilinear sets.
Keywords
The research of Oscar H. Ibarra was supported in part by NSF Grants CCR-0208595, CCF-0430945, IIS-0451097 and CCF-0524136. The research of Hsu-Chun Yen was supported in part by NSC Grant 93-2213-E-002-003, Taiwan.
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
Păun, G.: Computing with membranes. Turku University Computer Science Research Report No. 208 (1998)
Păun, G.: Computing with membranes. Journal of Computer and System Sciences 61, 108–143 (2000)
Păun, G.: Membrane Computing: An Introduction. Springer, Heidelberg (2002)
Păun, G., Rozenberg, G.: A guide to membrane computing. Theoretical Computer Science 287, 73–100 (2002)
Păun, A., Păun, G.: The power of communication: P systems with symport/antiport. New Generation Computers 20, 295–306 (2002)
Freund, R., Păun, G.: On deterministic P systems (2003), See P Systems Web Page at, http://psystems.disco.unimib.it
Sosik, P.: P systems versus register machines: two universality proofs. In: Pre-Proceedings of Workshop on Membrane Computing (WMC-CdeA 2002), Curtea de Argeş, Romania, pp. 371–382 (2002)
Freund, R., Kari, L., Oswald, M., Sosik, P.: Computationally universal P systems without priorities: two catalysts are sufficient. Theoretical Computer Science 330, 251–266 (2005)
Calude, C., Păun, G.: Computing with Cells and Atoms: After Five Years (new text added to Russian edition of the book with the same title first published by Taylor and Francis Publishers, London, 2001) to be published by Pushchino Publishing House (2004)
Păun, G.: Further twenty six open problems in membrane computing, Written for the Third Brainstorming Week on Membrane Computing, Sevilla, Spain (2005), see P Systems Web Page at, http://psystems.disco.unimib.it
Ginsburg, S.: The Mathematical Theory of Context-Free Languages. McGraw-Hill, New York (1966)
Higman, G.: Ordering by divisibility in abstract algebras. Proc. London Math. Soc. 3, 326–336 (1952)
Ibarra, O., Yen, H., Dang, Z.: The power of maximal parallelism in P systems. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol. 3340, pp. 212–224. Springer, Heidelberg (2004)
Bause, F.: On the analysis of Petri nets with static priorities. Acta Informatica 33, 669–685 (1996)
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
Ibarra, O.H., Yen, HC. (2006). On Deterministic Catalytic Systems. In: Farré, J., Litovsky, I., Schmitz, S. (eds) Implementation and Application of Automata. CIAA 2005. Lecture Notes in Computer Science, vol 3845. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11605157_14
Download citation
DOI: https://doi.org/10.1007/11605157_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31023-5
Online ISBN: 978-3-540-33097-4
eBook Packages: Computer ScienceComputer Science (R0)