Parallel Communicating Graph Grammar

In a Parallel Communicating Grammar System the components of a grammar system can also work in parallel (each having its own rewriting form) and communicate to each other in some way(sending the currently generated resultant graph to other components). In this paper we define parallel communicating edNCE graph grammar and parallel communicating ETPL(k) graph grammar. We present the condition to determine the parsing of a parallel communicating NCE graph grammar. PCedNCE graph grammar is found to be powerful than PCETPL(k) graph grammar.