On Membrane Computing Based on Splicing

Andrei Păun () and Mihaela Păun
Additional contact information
Andrei Păun: University of Western Ontario, Department of Computer Science
Mihaela Păun: University of Western Ontario, Department of Computer Science

Chapter Chapter 36 in Where Mathematics, Computer Science, Linguistics and Biology Meet, 2001, pp 409-422 from Springer

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

Keywords: Evolution Rule; Terminal Symbol; Discrete Apply Mathematic; Target Indication; Membrane Computing (search for similar items in EconPapers)
Date: 2001
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-94-015-9634-3_36

Ordering information: This item can be ordered from
http://www.springer.com/9789401596343

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

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().