作者: 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.