Title: Context-free graph P system

Authors: V. Thanga Murugeshwari; J.D. Emerald Princess Sheela

Addresses: Department of Mathematics, Queen Mary's College Chennai, Tamil Nadu, India ' Department of Mathematics, Queen Mary's College Chennai, Tamil Nadu, India

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.

Keywords: graph grammars; node replacement; P system.

DOI: 10.1504/IJAISC.2019.105021

International Journal of Artificial Intelligence and Soft Computing, 2019 Vol.7 No.1, pp.86 - 94

Received: 17 Mar 2019
Accepted: 08 Aug 2019
Published online: 10 Feb 2020 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article