A. V. Aho and J. D. Ullmann, The Theory of Parsing, Translation and Compiling, vol.1, 1972.

D. Angluin, Inductive inference of formal languages from positive data, Information and Control, vol.45, issue.2, pp.117-135, 1980.
DOI : 10.1016/S0019-9958(80)90285-5

J. Besombes and J. Marion, « Learning Reversible Categorial Grammars from Structures », Categorial Gramars, pp.148-163, 2004.

W. Buszkowski and G. Penn, Categorial grammars determined from linguistic data by unification, Studia Logica, vol.65, issue.4, pp.431-454, 1990.
DOI : 10.1007/BF00370157

A. Cornuéjols and L. Miclet, Apprentissage artificiel ; concepts et algorithmes, Editions Eyrolles, 2002.

F. Denis, A. Lemay, and A. Terlutte, « Some language classes identifiable in the limit from positive data », ICGI'02, LNAI 2484, pp.63-76, 2002.

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

C. C. Florêncio, « Consistent Identification in the Limit of Rigid Grammars from Strings Is NP-hard », ICGI'02, LNAI 2484, pp.49-62, 2002.

C. C. Florêncio, « Consistent Identification in the Limit of Any of the Classes k-valued Is NPhard », LACL'01, LNAI 2099, pp.125-134, 2001.

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. Hopcroft and J. Ullman, Introduction to Automata Theory, Languages, and Computation, 1979.

G. Huet and C. Rétoré, Survey of a few fundamental representation structures for computational linguistics, ESSLI lectures, 2002.

A. Joshi and Y. Schabes, Handbook of Formal Languages, vol3, pp.69-120, 1997.

M. Kanazawa, Identification in the limit of categorial grammars, Journal of Logic, Language and Information, vol.5, issue.2, pp.115-155, 1996.
DOI : 10.1007/BF00173697

M. Kanazawa, Learnable Classes of Categorial Grammars, FoLLI, 1998.

J. Lambek, The Mathematics of Sentence Structure, The Mathematics of Sentence Structure, pp.154-170, 1958.
DOI : 10.2307/2310058

J. Oncina and P. Garcia, « Inferring regular languages in polynomial update time », Pattern Recognition and Image Analysis, pp.49-61, 1992.

Y. Sakakibara, Learning context-free grammars from structural data in polynomial time, Theoretical Computer Science, vol.76, issue.2-3, pp.223-242, 1990.
DOI : 10.1016/0304-3975(90)90017-C

Y. Sakakibara, Efficient learning of context-free grammars from positive structural examples, Information and Computation, vol.97, issue.1, pp.23-60, 1992.
DOI : 10.1016/0890-5401(92)90003-X

W. A. Woods, Transition network grammars for natural language analysis, Communication of the ACM, pp.591-606, 1970.
DOI : 10.1145/355598.362773

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

«. Yokomori, On polynomial-time learnability in the limit of strictly deterministic automata, Machine Learning, pp.153-179, 1995.
DOI : 10.1007/BF01007463