The Family of Languages Generated by Non-cooperative Membrane Systems
The aim of this paper is to study the family of languages generated by the transitional membrane systems without cooperation and without additional ingredients. The fundamental nature of these basic systems makes it possible to also define the corresponding family of languages in terms of derivation trees of context-free grammars. We also compare this family to the well-known language families and discuss its properties. An example of a language is given which is considerably more “difficult” than those in the established lower bounds.
Unable to display preview. Download preview PDF.
- 1.Alhazov, A., Ciubotaru, C., Ivanov, S., Rogozhin, Y.: Membrane Systems Languages Are Polynomial-Time Parsable. Computer Science Journal of Moldova (2010) (submitted)Google Scholar
- 2.Alhazov, A., Ciubotaru, C., Rogozhin, Y., Ivanov, S.: The Membrane Systems Language Class. In: Eighth Brainstorming Week on Membrane Computing, Sevilla, 23–35 (2010); And LA Symposium, RIMS Kôkyûroku Series 1691, Kyoto University, pp. 44–50 (2010)Google Scholar
- 4.Bernardini, F., Gheorghe, M.: Language Generating by means of P Systems with Active Membranes. Brainstorming Week on Membrane Computing, Technical Report, 26/03, Rovira i Virgili University, Tarragona, 46–60 (2003)Google Scholar
- 14.P systems webpage, http://ppage.psystems.eu/