Parallel Communicating String - Graph P System

Authors

  • Meena Parvathy Sankar Madras Christian College, Chennai – 600 059
  • N.G. David Department of Mathematics, Madras Christian College, Chennai – 600 059

DOI:

https://doi.org/10.12723/mjs.19.6

Abstract

The concept of parallel communicating grammar systems generating string languages is extended to string-graph P systems and their generative power is studied. It is also established that for every language L generated by a parallel communicating grammar system there exists an equivalent parallel communicating string-graph P system generating the string-graph language corresponding to L.

References

J. Dassow and B. Truthe, "On the number of components for some parallel communicating grammar systems." Theoretical Computer Science, vol. 387 pp 136-146, 2007.

J. Dassow, G. Paun and G. Rosenberg. “Grammar systems.” Handbook of formal languages, Springer, pp 155-213, 1997.

G. Paun and G. Rozenberg. “A Guide to membrane computing.” Theoretical Computer Science, vol. 287, pp. 73-100, 2002.

A. Habel. “Hyperedge replacement: Grammars and Languages.” Lecture notes in Computer Science, vol. 643, Springer-Verlag, New York.

Published

2021-08-26

Issue

Vol. 10 No. 2 (2011): Mapana Journal of Sciences

Section

Research Articles

License

Copyright (c) 2011 Meena Parvathy Sankar, N.G. David

Creative Commons License

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Most read articles by the same author(s)