On Membrane Computing Based on Splicing

作者: Andrei Păun , Mihaela Păun

DOI: 10.1007/978-94-015-9634-3_36

关键词:

摘要: This paper is a direct continuation of [11]. Characterizations recursively enumerable languages are given, by means splicing P systems, having rules small size (that is, involving short context strings). Also it shown that with only two membranes we can generate all the languages; this improves result from [11], where three used.

参考文章(12)
Gheorghe Paun, Computing with Membranes: An Introduction. Bulletin of The European Association for Theoretical Computer Science. ,vol. 67, pp. 139- 152 ,(1999)
Gheorghe Păun, Sheng Yu, On Synchronization in P Systems Fundamenta Informaticae. ,vol. 38, pp. 397- 410 ,(1999) , 10.3233/FI-1999-38404
Karel Culik, Tero Harju, Splicing semigroups of dominoes and DNA Discrete Applied Mathematics. ,vol. 31, pp. 261- 277 ,(1991) , 10.1016/0166-218X(91)90054-Z
Dennis Pixton, Regularity of splicing languages Discrete Applied Mathematics. ,vol. 69, pp. 101- 124 ,(1996) , 10.1016/0166-218X(95)00079-7
Gheorghe Păun, Regular extended H systems are computationally universal Journal of Automata, Languages and Combinatorics. ,vol. 1, pp. 27- 36 ,(1996)
Andrei Păun, Controlled H systems of small radius Fundamenta Informaticae. ,vol. 31, pp. 185- 193 ,(1997) , 10.3233/FI-1997-31206
Gheorghe Păun, Computing with Membranes Journal of Computer and System Sciences. ,vol. 61, pp. 108- 143 ,(2000) , 10.1006/JCSS.1999.1693
Gheorghe Paun, Jurgen Dassow, On the Power of Membrane Computing Journal of Universal Computer Science. ,vol. 5, pp. 33- 49 ,(1998)