Abstract
We consider rewriting P systems with parallel application of evolution rules, where no conflicts on the communication of objects can arise. Different parallelism methods are used and only rules which have the same target indication can be simultaneously applied to a common string. The computational power is analyzed, with respect to Lindenmayer systems, and some relations among different parallel rewriting P systems are studied. Some open problems are also formulated.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Work partially supported by contribution of EU commission under The Fifth Framework Programme, project “MolCoNet” IST-2001-32008.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
D. Besozzi, C. Ferretti, G. Mauri, C. Zandron, Parallel Rewriting P Systems with Deadlock, Pre-Proceedings of DNA8 Conference (M. Hagiya, A. Ohuchi, eds.), Hokkaido University, Japan, June 2002, 171–183.
J. Dassow, Gh. Păun, Regulated Rewriting in Formal Language Theory, Springer-Verlag, Berlin, 1989.
C. Ferretti, G. Mauri, C. Zandron, G. Păun, On Three Variants of Rewriting P Systems, Theoretical Computer Science, to appear.
S. N. Krishna, Languages of P systems: Computability and Complexity, PhD Thesis, 2001.
S. N. Krishna, R. Rama, A Note on Parallel Rewriting in P Systems, Bulletin of the EATCS, 73 (February 2001), 147–151.
S. N. Krishna, R. Rama, On the Power of P Systems Based on Sequential/Parallel Rewriting, Intern. J. Computer Math., 77, 1–2(2000), 1–14.
Gh. Păun, Computing with Membranes, Journal of Computer and System Sciences, 61, 1 (2000), 108–143 (see also Turku Center for Computer Science-TUCS Report No 208, 1998, www.tucs..).
G. Rozenberg, A. Salomaa, eds., Handbook of Formal Languages, Springer-Verlag, Heidelberg, 1997.
G. Rozenberg, A. Salomaa, The Mathematical Theory of L Systems, Academic Press, New York, 1980.
C. Zandron, AMo del for Molecular Computing: Membrane Systems, PhD Thesis, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Besozzi, D., Mauri, G., Zandron, C. (2003). Parallel Rewriting P Systems without Target Conflicts. In: PĂun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds) Membrane Computing. WMC 2002. Lecture Notes in Computer Science, vol 2597. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36490-0_9
Download citation
DOI: https://doi.org/10.1007/3-540-36490-0_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00611-4
Online ISBN: 978-3-540-36490-0
eBook Packages: Springer Book Archive