Collapsing Hierarchies of Parallel Rewriting P Systems without Target Conflicts

  • Daniela Besozzi
  • Giancarlo Mauri
  • György Vaszil
  • Claudio Zandron
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2933)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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)CrossRefGoogle Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    Besozzi, D., Mauri, G., Zandron, C.: Hierarchies of Parallel Rewriting P Systems – A Survey, New Generation Computing (to appear)Google Scholar
  4. 4.
    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)CrossRefGoogle Scholar
  5. 5.
    Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. Springer, Berlin (1989)Google Scholar
  6. 6.
    Ferretti, C., Mauri, G., Zandron, C., Păun, G.: On Three Variants of Rewriting P Systems. Theoretical Computer Science (to appear)Google Scholar
  7. 7.
    Krishna, S.N.: Languages of P systems: Computability and Complexity, PhD Thesis (2001)Google Scholar
  8. 8.
    Krishna, S.N., Rama, R.: A Note on Parallel Rewriting in P Systems. Bulletin of the EATCS 73, 147–151 (2001)MATHMathSciNetGoogle Scholar
  9. 9.
    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)Google Scholar
  10. 10.
    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 MATHMathSciNetCrossRefGoogle Scholar
  11. 11.
    Păun, G.: Computing with Membranes: An Introduction. Springer, Berlin (2002)Google Scholar
  12. 12.
    Rozenberg, G., Salomaa, A. (eds.): New Trends in Formal Languages. LNCS, vol. 1218. Springer, Heidelberg (1997)MATHGoogle Scholar
  13. 13.
    Rozenberg, G., Salomaa, A.: The Mathematical Theory of L Systems. Academic Press, New York (1980)MATHGoogle Scholar
  14. 14.
    Zandron, C.: A Model for Molecular Computing: Membrane Systems, PhD Thesis (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Daniela Besozzi
    • 1
  • Giancarlo Mauri
    • 2
  • György Vaszil
    • 3
  • Claudio Zandron
    • 2
  1. 1.Dipartimento di Informatica e ComunicazioneUniversità degli Studi di MilanoMilanoItaly
  2. 2.Dipartimento di Informatica, Sistemistica e ComunicazioneUniversità degli Studi di Milano-BicoccaMilanoItaly
  3. 3.Computer and Automation Research InstituteHungarian Academy of SciencesBudapestHungary

Personalised recommendations