Chapter 11: Inference (Induction) of Graph Languages

As we have mentioned in Chap. 2, a syntactic pattern recognition model is complete if a corresponding language inference algorithm is defined. Unfortunately, the problem of grammatical inference for graph languages is even more difficult than that for tree grammars. The main issue in the case of graph grammar induction consists in handling the embedding transformation…