ON THE APPLICATION OF MULTISET TO DETERMINISTIC COOPERATIVE SPECIALIZATION P SYSTEM UNDER CATALYSIS
Abstract
Quasi-general models of membrane computing have been designed by means of rules which represent the processes taking place in a biological cell without explicitly specifying the specialties of the rules, viz: their mixture, chemical or physical characteristics as is obtainable in a biological cell. In this paper, an attempt to model a variant of membrane computing called specialization P system is made. It is capable of simulating biological activities at cellular level, and as the name implies, in a specialized manner. It is shown that with only one membrane and three rules, a deterministic cooperative specialization P system under catalysis is able to characterize the family of recursively enumerable languages.
References
Freund, R. and Oswald, M. (2002), A short note on analysing P systems with antiport rules. Bulletin of the EATCS, Vol. 78: pp. 231-236.
Freund, R. and Păun, Gh. (2003), On deterministic P systems. See P Systems Web Page at http://psystems. disco. unimib. it.
Minsky, M. L. (1967),Computation: finite and infnite machines. Prentice-Hall, Inc.
Păun, Gh., (2000), Computing with membranes. Journal of Computer and System Sciences, Vol. 61(1): 108-143.
Păun, Gh., (2002), Membrane Computing. An Introduction, Springer-Verlag, Berlin.
Păun, Gh., (2006). Introduction to membrane computing. In Applications of Membrane Computing. pp. 1-42 Springer Berlin Heidelberg.
Păun, G. (2010). A quick introduction to membrane computing. The Journal of Logic and Algebraic Programming, 79(6), 291-294.
Soare, R. I. (2016). Turing computability: Theory and applications. Springer Berlin Heidelberg.
Copyright (c) 2022 FUDMA JOURNAL OF SCIENCES
This work is licensed under a Creative Commons Attribution 4.0 International License.
FUDMA Journal of Sciences
