R. Brijder and H. Blockeel, On the inference of non-confluent NLC graph grammars, Journal of Logic and Computation, vol.23, issue.4, 2011.
DOI : 10.1093/logcom/exr046

A. Clark, Towards general algorithms for grammatical inference, Proc. of ALT, pp.11-30, 2010.

A. Clark and R. Eyraud, Polynomial identification in the limit of substitutable context-free languages, J. Machine Learning Research, vol.8, pp.1725-1745, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00186889

D. J. Cook and L. B. Holder, Graph-based data mining, IEEE Intelligent Systems, vol.15, issue.2, pp.32-41, 2000.
DOI : 10.1109/5254.850825

C. Costaflorencio, Identification of hyperedge-replacement graph grammars, MLG'09, Poster Session, 2009.

C. De and . Higuera, Characteristic sets for polynomial grammatical inference, Machine Learning Journal, vol.27, pp.125-138, 1997.

C. De-la-higuera, J. Janodet, E. Samuel, G. Damiand, and C. Solnon, Polynomial algorithms for open plane graph and subgraph isomorphisms, Theoretical Computer Science, vol.498, 2012.
DOI : 10.1016/j.tcs.2013.05.026

URL : https://hal.archives-ouvertes.fr/hal-00832098

P. Dupont, L. Miclet, and E. Vidal, What is the search space of the regular inference?, Proc. of ICGI, pp.25-37, 1994.
DOI : 10.1007/3-540-58473-0_134

I. Fáry, On straight line representation of planar graphs, Acta Univ Szeged. Sect. Sci. Math, vol.11, pp.229-233, 1948.

E. Fusy, Combinatoire des graphes planaires et applications algorithmiques, 2007.

A. Gibbons, Algorithmic graph theory, 1985.

E. Gold, Language identification in the limit, Information and Control, vol.10, issue.5, pp.447-474, 1967.
DOI : 10.1016/S0019-9958(67)91165-5

J. Huan, W. Wang, and J. Prins, Efficient mining of frequent subgraphs in the presence of isomorphism, Third IEEE International Conference on Data Mining, pp.549-552, 2003.
DOI : 10.1109/ICDM.2003.1250974

E. Jeltsch and H. Kreowski, Grammatical inference based on hyperedge replacement, Proc. Graph Grammars and their Application to Computer Science, pp.461-474, 1991.
DOI : 10.1007/BFb0017406

I. Jonyer, L. B. Holder, and D. J. Cook, MDL-BASED CONTEXT-FREE GRAPH GRAMMAR INDUCTION AND APPLICATIONS, International Journal on Artificial Intelligence Tools, vol.13, issue.01, pp.65-79, 2003.
DOI : 10.1142/S0218213004001429

A. Kasprzik and R. Yoshinaka, Distributional Learning of Simple Context-Free Tree Grammars, ALT, pp.398-412, 2011.
DOI : 10.1007/978-3-642-24412-4_31

J. Kukluk, L. Holder, and D. Cook, INFERENCE OF EDGE REPLACEMENT GRAPH GRAMMARS, International Journal on Artificial Intelligence Tools, vol.17, issue.03, pp.539-554, 2008.
DOI : 10.1142/S0218213008004047

C. Lautemann, The complexity of graph languages generated by hyperedge replacement, Acta Informatica, vol.33, issue.5, pp.399-421, 1989.
DOI : 10.1007/BF00289017

T. Matsuda, H. Motoda, and T. Washio, Graph-based induction and its applications, Advanced Engineering Informatics, vol.16, issue.2, pp.135-143, 2002.
DOI : 10.1016/S1474-0346(02)00005-8

G. Rozenberg and H. Ehrig, Handbook of Graph Grammars and Computing by Graph Transformation, World Scientific, vol.13, 1997.
DOI : 10.1142/3303

E. Samuel, C. De-la-higuera, and J. Janodet, Extracting Plane Graphs from Images, SSPR/SPR, pp.233-243, 2010.
DOI : 10.1007/978-3-642-14980-1_22

URL : https://hal.archives-ouvertes.fr/ujm-00531224

S. Vishwanathan, N. Schraudolph, R. I. Kondor, and K. Borgwardt, Graph kernels, Journal of Machine Learning Research, vol.11, pp.1201-1242, 2010.