Abstract
We continue the investigation of parallel rewriting P systems without target conflicts, a class of rewriting P systems with parallel application of evolution rules where the possible consistency problems for the communication of the resulting strings are eliminated by not allowing the application of conflicting rules. We refine and improve some of the previously known results about the generative power of these systems and point out the problems which are still open for investigation.
Work partially supported by contribution of the EU commission under The Fifth Framework Programme, project “MolCoNet” IST-2001-32008, and by contribution of the Hungarian Scientific Research Fund, OTKA, grant no. F 037567.
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
Besozzi, D., Ferretti, C., Mauri, G., Zandron, C.: Parallel Rewriting P Systems with Deadlock. In: Hagiya, M., Ohuchi, A. (eds.) DNA 2002. LNCS, vol. 2568, pp. 302–314. Springer, Heidelberg (2003)
Besozzi, D., Mauri, G., Zandron, C.: Hierarchies of Parallel Rewriting P Systems. In: Cavaliere, M., Martín- Vide, C., Păun, G. (eds.) Brainstorming Week on Membrane Computing, Rovira i Virgili University Technical Report No. 26, Tarragona, February 5-11, pp. 61–74 (2003)
Besozzi, D., Mauri, G., Zandron, C.: Hierarchies of Parallel Rewriting P Systems – A Survey, New Generation Computing (to appear)
Besozzi, D., Mauri, G., Zandron, C.: Parallel Rewriting P Systems without Target Conflicts. In: Păun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC 2002. LNCS, vol. 2597, pp. 119–133. Springer, Heidelberg (2003)
Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. Springer, Berlin (1989)
Ferretti, C., Mauri, G., Zandron, C., Păun, G.: On Three Variants of Rewriting P Systems. Theoretical Computer Science (to appear)
Krishna, S.N.: Languages of P systems: Computability and Complexity, PhD Thesis (2001)
Krishna, S.N., Rama, R.: A Note on Parallel Rewriting in P Systems. Bulletin of the EATCS 73, 147–151 (2001)
Krishna, S.N., Rama, R.: On the Power of P Systems Based on Sequential/Parallel Rewriting. Intern. J. Computer Math. 77(1–2), 1–14 (2000)
Păun, G.: Computing with Membranes. Journal of Computer and System Sciences 61(1), 108–143 (2000); see also Turku Center for Computer Science-TUCS Report 208 (1998), www.tucs.fi
Păun, G.: Computing with Membranes: An Introduction. Springer, Berlin (2002)
Rozenberg, G., Salomaa, A. (eds.): New Trends in Formal Languages. LNCS, vol. 1218. Springer, Heidelberg (1997)
Rozenberg, G., Salomaa, A.: The Mathematical Theory of L Systems. Academic Press, New York (1980)
Zandron, C.: A Model for Molecular Computing: Membrane Systems, PhD Thesis (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Besozzi, D., Mauri, G., Vaszil, G., Zandron, C. (2004). Collapsing Hierarchies of Parallel Rewriting P Systems without Target Conflicts. In: Martín-Vide, C., Mauri, G., Păun, G., Rozenberg, G., Salomaa, A. (eds) Membrane Computing. WMC 2003. Lecture Notes in Computer Science, vol 2933. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24619-0_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-24619-0_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20895-2
Online ISBN: 978-3-540-24619-0
eBook Packages: Springer Book Archive