Learning Substitutable Binary Plane Graph Grammars - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Learning Substitutable Binary Plane Graph Grammars


While some heuristics exist for the learning of graph grammars, few has been done on the theoretical side. Due to complexity issues, the class of graphs has to be restricted: this paper deals with the subclass of plane graphs, which correspond to drawings of planar graphs. This allows us to introduce a new kind of graph grammars, using a face-replacement mechanism. To learn them, we extend recent successful techniques developed for string grammars, and based on a property on target languages: the substitutability property. We show how this property can be extended to plane graph languages and nally state the rst identi cation in the limit result for a class of graph grammars, as far as we know.
Fichier principal
Vignette du fichier
eyraud12a.pdf (390.2 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00958063 , version 1 (11-03-2014)


  • HAL Id : hal-00958063 , version 1


Rémi Eyraud, Jean-Christophe Janodet, Tim Oates. Learning Substitutable Binary Plane Graph Grammars. International Colloquium in Grammatical Inference, Sep 2012, College Park, United States. ⟨hal-00958063⟩
159 View
79 Download


Gmail Facebook X LinkedIn More