Nce graph grammar and its applications

Abstract

The thesis deals mainly with Boundary edge directed NCE recursive graph grammar, Parallel Communicating edge directed NCE graph grammar, Parallel Communicating ETPL(k) graph grammar, Boundary Parallel Communicating edge directed NCE graph grammar, Parallel communicating graph grammar with double pushout approach, and applications of NCE graph grammar. The preliminaries of the graph grammar, Parallel Communicating edge directed NCE graph grammar, Parallel Communicating ETPL (k) graph grammar, Boundary Parallel Communicating edge directed NCE graph grammar, Parallel communicating graph grammar with double pushout approach and the brief outline of the thesis are discussed. A new notion of B-edNCE recursive graph grammar is discussed also shows that the hypercube model is B-edNCE recursive graph grammar and generate recursive enumerable language and closure properties, membership and undecidability results for other decision problems are studied. A new notion of the Parallel Communicating edNCE graph grammar and Parallel Communicating ETPL(k) graph grammar are reformulated based on parallel communicating system and the generative power of PCedNCE graph grammar with edNCE graph grammar also PCedNCE graph grammar with PCETPL(k) graph grammar are discussed. The notion of the Boundary Parallel Communicating edNCE graph grammar are reformulated based on parallel communicating system and the generative power of Boundary Parallel Communicating edNCE graph grammar with PCETPL(k) graph grammar are discussed and also few properties have been discussed. The notion of Parallel communicating graph grammar with double pushout approach is discussed and this concept is extended to monadic second order logic, isomorphism and the decision properties through graph grammar also few properties have been discussed. newline

Description

Keywords

Citation

item.page.endorsement

item.page.review

item.page.supplemented

item.page.referenced