Abstract
The paper answers an open problem from [4], proving that transition P systems with non-cooperative rules using priorities generate exactly the Parikh images of ET0L languages.
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
Bottoni, P., Martín-Vide, C., Păun, G., Rozenberg, G.: Membrane systems with promoters/inhibitors. Acta Informatica 38, 695–720 (2002)
Ionescu, M., Sburlan, D.: On P systems with promoters/inhibitors. Journal of Universal Computer Science 10, 581–599 (2004)
Păun, G.: Computing with membranes. Journal of Computer and System Sciences 61, 108–143 (2000)
Păun, G.: Membrane Computing. An Introduction. Springer, Berlin (2002)
Rozenberg, G., Salomaa, A.: The Mathematical Theory of L Systems. Academic Press, New York (1980)
Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Berlin (1997)
Sburlan, D.: Further results on P systems with promoters/inhibitors. Intern. J. Found. Computer Sci. (to appear)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sburlan, D. (2006). Non-cooperative P Systems with Priorities Characterize PsET0L. In: Freund, R., Păun, G., Rozenberg, G., Salomaa, A. (eds) Membrane Computing. WMC 2005. Lecture Notes in Computer Science, vol 3850. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11603047_25
Download citation
DOI: https://doi.org/10.1007/11603047_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30948-2
Online ISBN: 978-3-540-32340-2
eBook Packages: Computer ScienceComputer Science (R0)