About Splicing P Systems with Immediate Communication and Non-extended Splicing P Systems
- 279 Downloads
We consider splicing P systems with immediate communication introduced by Gh. Păun in . We solve the open problem Q17 from that book by proving that systems with two membranes can generate any recursively enumerable language. We discuss the similarities between splicing P systems with immediate communication having two membranes and time-varying distributed H systems with two components. We also consider non-extended splicing P systems, i.e., without a terminal alphabet. We show that it is possible to generate any recursively enumerable language by such systems with two membranes. In this way we solve the open problem Q16 from the same book.
KeywordsEvolution Rule Elementary Membrane Formal Grammar Membrane Computing Skin Membrane
Unable to display preview. Download preview PDF.
- 7.Verlan, S., Margenstern, M.: About splicing P systems with one membrane (in preparation)Google Scholar