Abstract
We consider P systems with active membranes, but without polarizations, yet with using membrane division and membrane generation, but as the result of a halting computation we do not take the terminal string generated in a designated output membrane, instead we consider the resulting tree representing the membrane structure of the final configuration as its result. We show that each recursively enumerable tree language can be obtained in that way generated by P systems with active membranes working on strings.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. Springer, Berlin (1989)
Freund, R., Martin-Vide, C., Păun, G.: From regulated rewriting to computing with membranes: collapsing hierarchies. Theoretical Computer Science 312, 143–188 (2004)
Freund, R., Oswald, M.: GP systems with forbidding context. Fundamenta Informaticae 49(1-3), 81–102 (2002)
Freund, R., Păun, A.: P systems with active membranes and without polarizations. Soft Computing (to appear)
Freund, R., Păun, G.: On the number of non-terminal symbols in graph-controlled, programmed and matrix grammars. In: Margenstern, M., Rogozhin, Y. (eds.) MCU 2001. LNCS, vol. 2055, pp. 214–225. Springer, Heidelberg (2001)
Hopcroft, J., Ulmann, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)
Krishna, S.N., Rama, R.: A variant of P systems with active membranes: solving NP-complete problems. Romanian J. of Information Science and Technology 2(4), 357–367 (1999)
Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs (1967)
The P Systems Web Page: http://psystems.disco.unimib.it/
Păun, A.: On P systems with active membranes. In: Antoniou, I., Calude, C.S., Dinneen, M.J. (eds.) Proc. of the First International Conference on Unconventional Models of Computation (UMC 2000). Discrete Mathematics and Theoretical Computer Science, pp. 187–201. Springer, Brussels (2000)
Păun, G.: Computing with membranes. Journal of Computer and System Sciences 61(1), 108–143 (2000), and TUCS Research Report 208 (1998), http://www.tucs.fi
Păun, G.: P systems with active membranes: attacking NP complete problems. Journal of Automata, Languages and Combinatorics 6(1), 75–90 (2001)
Păun, G.: Membrane Computing: An Introduction. Springer, Berlin (2002)
Păun, G., Suzuki, Y., Tanaka, H., Yokomori, T.: On the power of membrane division in P systems. Publ. Math Debrecen 62 (2004)
Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Berlin (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Freund, R., Oswald, M., Păun, A. (2005). P Systems Generating Trees. In: Mauri, G., Păun, G., Pérez-Jiménez, M.J., Rozenberg, G., Salomaa, A. (eds) Membrane Computing. WMC 2004. Lecture Notes in Computer Science, vol 3365. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31837-8_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-31837-8_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25080-7
Online ISBN: 978-3-540-31837-8
eBook Packages: Computer ScienceComputer Science (R0)