Non-Confluent NLC Graph Grammar Inference by Compressing Disjoint Subgraphs

Details Non-Confluent NLC Graph Grammar Inference by Compressing Disjoint Subgraphs Non-Confluent NLC Graph Grammar Inference by Compressing Disjoint Subgraphs

2009-01-30

arxiv.org/abs/0901.4876v1

Computer Science

Learning

12 pages, 1 figure

Scientific paper

Grammar inference deals with determining (preferable simple) models/grammars consistent with a set of observations. There is a large body of research on grammar inference within the theory of formal languages. However, there is surprisingly little known on grammar inference for graph grammars. In this paper we take a further step in this direction and work within the framework of node label controlled (NLC) graph grammars. Specifically, we characterize, given a set of disjoint and isomorphic subgraphs of a graph $G$, whether or not there is a NLC graph grammar rule which can generate these subgraphs to obtain $G$. This generalizes previous results by assuming that the set of isomorphic subgraphs is disjoint instead of non-touching. This leads naturally to consider the more involved ``non-confluent'' graph grammar rules.

Affiliated with

Also associated with

No associations

Rating

Non-Confluent NLC Graph Grammar Inference by Compressing Disjoint Subgraphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Non-Confluent NLC Graph Grammar Inference by Compressing Disjoint Subgraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Non-Confluent NLC Graph Grammar Inference by Compressing Disjoint Subgraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-424821