Context-free graph P system
by V. Thanga Murugeshwari; J.D. Emerald Princess Sheela
International Journal of Artificial Intelligence and Soft Computing (IJAISC), Vol. 7, No. 1, 2019

Abstract: Graph grammar is a rewriting system generating graph languages. Context-free graph grammars are studied developing a theory similar to that of context-free string languages. In this paper we define context-free node replacement graph P system with conditional communication and context-free node replacement graph rewriting P system. Results on the notions such as the minimum number of membranes required to generate a family of context-free graph languages are discussed.

Online publication date: Mon, 10-Feb-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Artificial Intelligence and Soft Computing (IJAISC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com