A. Ambainis, S. Jain, and A. Sharma, Ordinal mind change complexity of language identification, pp.323-343, 1999.

D. Angluin, Finding patterns common to a set of strings, Journal of Computer and System Sciences, vol.21, issue.1, pp.46-62, 1980.
DOI : 10.1016/0022-0000(80)90041-0

D. Angluin, Queries and concept learning, Machine Learning, pp.319-342, 1987.
DOI : 10.1007/BF00116828
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.454.4681

D. Angluin, J. Aspnes, and A. Kontorovich, On the Learnability of Shuffle Ideals, Algorithmic Learning Theory, 23rd International Conference Proceedings, pp.111-123, 2012.
DOI : 10.1007/978-3-642-34106-9_12

L. Becerra-bonache, A. Dediu, and C. , Tirn? auc? a. Learning dfa from correction and equivalence queries, Proceedings of the International Colloquium on Grammatical Inference, pp.281-292, 2006.

L. E. Blum and M. Blum, Toward a mathematical theory of inductive inference, Information and Control, vol.28, issue.2, pp.125-155, 1975.
DOI : 10.1016/S0019-9958(75)90261-2

A. Blumer, A. Ehrenfeucht, D. Haussler, and M. Warmuth, Learnability and the Vapnik-Chervonenkis dimension, Journal of the ACM, vol.36, issue.4, pp.929-965, 1989.
DOI : 10.1145/76359.76371

R. Book and F. Otto, String-Rewriting Systems, 1993.
DOI : 10.1007/978-1-4613-9771-7

J. Case and T. Kötzing, Difficulties in Forcing Fairness of Polynomial Time Inductive Inference, Proceedings of ALT'09, pp.263-277, 2009.
DOI : 10.1007/978-1-4612-0249-3

N. Chomsky, Three models for the description of language, IEEE Transactions on Information Theory, vol.2, issue.3, pp.113-124, 1956.
DOI : 10.1109/TIT.1956.1056813

A. Clark, Learning trees from strings: A strong learning algorithm for some context-free grammars, Journal of Machine Learning Research, vol.14, pp.3537-3559, 2014.

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

A. Clark and S. Lappin, Linguistic Nativism and the Poverty of the Stimulus, 2011.
DOI : 10.1002/9781444390568

A. Clark and F. Thollard, Pac-learnability of probabilistic deterministic finite state automata, JOURNAL OF MACHINE LEARNING RESEARCH, vol.5, pp.473-497, 2004.

A. Clark and R. Yoshinaka, Distributional learning of parallel multiple context-free grammars, Machine Learning, 2013.
DOI : 10.1007/s10994-013-5403-2

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

C. De and . Higuera, Grammatical inference: learning automata and grammars, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00476128

C. De-la-higuera and J. Oncina, Learning deterministic linear languages, Proceedings of COLT'02, volume 2375 of LNAI, pp.185-200, 2002.

P. Dupont, L. Miclet, and E. Vidal, What is the search space of the regular inference?, Proceedings of the International Colloquium on Grammatical Inference, number 862 in LNAI, pp.25-37, 1994.
DOI : 10.1007/3-540-58473-0_134

R. Eyraud, C. De-la-higuera, and J. Janodet, LARS: A learning algorithm for rewriting systems, Machine Learning, vol.1, issue.298, pp.7-31, 2007.
DOI : 10.1007/s10994-006-9593-8
URL : https://hal.archives-ouvertes.fr/hal-00323308

F. Girosi, An Equivalence Between Sparse Approximation and Support Vector Machines, Neural Computation, vol.20, issue.6, pp.1455-1480, 1998.
DOI : 10.1007/BF01437407
URL : http://alpha-bits.ai.mit.edu/people/girosi/home-page/Girosi98.pdf

E. M. 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. Heinz, Computational theories of learning and developmental psycholinguistics The Cambridge Handbook of Developmental Linguistics, 2014.

D. Hsu, S. M. Kakade, and P. Liang, Identifiability and unmixing of latent parse trees, Advances in Neural Information Processing Systems (NIPS), pp.1520-1528, 2013.

M. Isberner, F. Howar, and B. Steffen, Learning register automata: from languages to program structures, Machine Learning, pp.1-34, 2013.
DOI : 10.1007/s10994-013-5419-7

Y. Ishigami and S. Tani, VC-dimensions of finite automata and commutative finite automata with k letters and n states, Discrete Applied Mathematics, vol.74, issue.2, pp.123-134, 1997.
DOI : 10.1016/S0166-218X(96)00025-X

J. Langford, Tutorial on practical prediction theory for classification, J. Mach. Learn. Res, vol.6, pp.273-306, 2005.

M. Li and P. Vitanyi, Learning Simple Concepts under Simple Distributions, SIAM Journal on Computing, vol.20, issue.5, pp.911-935, 1991.
DOI : 10.1137/0220056
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.7234

E. Moore, Gedanken-Experiments on Sequential Machines, Automata Studies, pp.129-153, 1956.
DOI : 10.1515/9781400882618-006

T. Oates, D. Desai, and V. Bhat, Learning k-reversible context-free grammars from positive structural examples, Proc. of the Internation Conference in Machine Learning, pp.459-465, 2002.

J. Oncina and P. García, IDENTIFYING REGULAR LANGUAGES IN POLYNOMIAL TIME, Advances in Structural and Syntactic Pattern Recognition of Series in Machine Perception and Artificial Intelligence, pp.99-108, 1992.
DOI : 10.1142/9789812797919_0007

T. Pao, J. Carr, and I. , A solution of the syntactical induction-inference problem for regular languages, Computer Languages, vol.3, issue.1, pp.53-64, 1978.
DOI : 10.1016/0096-0551(78)90006-1

L. Pitt, Inductive inference, DFA's, and computational complexity, Analogical and Inductive Inference, number 397 in LNAI, pp.18-44, 1989.
DOI : 10.1007/3-540-51734-0_50
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.187.9810

D. Ron, Y. Singer, and N. Tishby, On the learnability and usage of acyclic probabilistic finite automata, Proceedings of COLT 1995, pp.31-40, 1995.

G. Rozenberg, Handbook of Graph Grammars and Computing by Graph Transformation: Volume I. Foundations, 1997.
DOI : 10.1142/3303

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

H. Seki, T. Matsumura, M. Fujii, and T. Kasami, On multiple context-free grammars, Theoretical Computer Science, vol.88, issue.2, pp.191-229, 1991.
DOI : 10.1016/0304-3975(91)90374-B

J. M. Sempere and P. García, A characterization of even Linear Languages and its application to the learning problem, Proc. of the International Colloquium in Grammatical Inference, pp.38-44, 1994.
DOI : 10.1007/3-540-58473-0_135

C. Shibata and R. Yoshinaka, PAC Learning of Some Subclasses of Context-Free Grammars with Basic Distributional Properties from Positive Data, Proceedings of Algorithmic Learning Theory, pp.143-157, 2013.
DOI : 10.1007/978-3-642-40935-6_11

Y. Tajima, E. Tomita, M. Wakatsuki, and M. Terada, Polynomial time learning of simple deterministic languages via queries and a representative sample, Theoretical Computer Science, vol.329, issue.1-3, pp.1-3203, 2004.
DOI : 10.1016/j.tcs.2004.08.012

L. G. Valiant, A theory of the learnable, Communications of the ACM, vol.27, issue.11, pp.1134-1142, 1984.
DOI : 10.1145/1968.1972

V. Vapnik, The nature of statistical learning theory, 1995.

M. Wakatsuki and E. Tomita, A fast algorithm for checking the inclusion for very simple deterministic pushdown automata, IEICE TRANSACTIONS on Information and Systems, issue.10, pp.76-1224, 1993.

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

T. Yokomori, Polynomial-time identification of very simple grammars from positive data, Theoretical Computer Science, vol.298, issue.1, pp.179-206, 2003.
DOI : 10.1016/S0304-3975(02)00423-1

R. Yoshinaka, Identification in the Limit of k,l-Substitutable Context-Free Languages, Proc. of the International Colloquium in Grammatical Inference, pp.266-279, 2008.
DOI : 10.1007/978-3-540-88009-7_21

R. Yoshinaka, Learning efficiency of very simple grammars from positive data, Theoretical Computer Science, vol.410, issue.19, pp.1807-1825, 2009.
DOI : 10.1016/j.tcs.2009.01.012

R. Yoshinaka, Efficient learning of multiple context-free languages with multidimensional substitutability from positive data, Theoretical Computer Science, vol.412, issue.19, pp.1821-1831, 2011.
DOI : 10.1016/j.tcs.2010.12.058

T. Zeugmann, Can learning in the limit be done efficiently?, Proceedings of ALT'03, pp.17-38, 2003.

T. Zeugmann, From learning in the limit to stochastic finite learning, Theoretical Computer Science, vol.364, issue.1, pp.77-97, 2006.
DOI : 10.1016/j.tcs.2006.07.042