Parallel Rewriting P Systems without Target Conflicts
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.
Unable to display preview. Download preview PDF.
- 1.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.Google Scholar
- 2.J. Dassow, Gh. Păun, Regulated Rewriting in Formal Language Theory, Springer-Verlag, Berlin, 1989.Google Scholar
- 3.C. Ferretti, G. Mauri, C. Zandron, G. Păun, On Three Variants of Rewriting P Systems, Theoretical Computer Science, to appear.Google Scholar
- 4.S. N. Krishna, Languages of P systems: Computability and Complexity, PhD Thesis, 2001.Google Scholar
- 5.S. N. Krishna, R. Rama, A Note on Parallel Rewriting in P Systems, Bulletin of the EATCS, 73 (February 2001), 147–151.Google Scholar
- 6.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.Google Scholar
- 10.C. Zandron, AMo del for Molecular Computing: Membrane Systems, PhD Thesis, 2001.Google Scholar