P. Adriaans, Learning shallow context-free languages under simple distributions, Algebras, Diagrams and Decisions in Language, Logic and Computation, 2002.

P. Adriaans, M. Trautwein, and M. Vervoort, Towards High Speed Grammar Induction on Large Text Corpora, SOFSEM 2000, pp.173-186, 2000.
DOI : 10.1007/3-540-44411-4_11

D. Angluin, Inference of Reversible Languages, Journal of the ACM, vol.29, issue.3, pp.741-765, 1982.
DOI : 10.1145/322326.322334

R. Book and F. Otto, String Rewriting Systems, 1993.

N. Chomsky, Systems of syntactic analysis, The Journal of Symbolic Logic, vol.15, issue.03, pp.242-256, 1953.
DOI : 10.2307/409987

S. Crain and M. Nakayama, Structure Dependence in Grammar Formation, Language, vol.63, issue.3, pp.522-543, 1987.
DOI : 10.2307/415004

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

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

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

X. N. Kam, I. Stoyneshka, L. Tornyova, J. D. Fodor, and W. G. Sakas, Non-robustness of syntax acquisition from n-grams: A cross-linguistic perspective, The 18th Annual CUNY Sentence Processing Conference, 2005.

J. A. Laxminarayana and G. Nagaraja, Inference of a subclass of context free grammars using positive samples, Proceedings of the Workshop on Learning Context-Free, 2003.

M. Lohrey, Word Problems and Confluence Problems for Restricted Semi-Thue Systems, RTA, pp.172-186, 2000.
DOI : 10.1007/10721975_12

E. Makinen, On inferring zero-reversible languages, Acta Cybernetica, vol.14, pp.479-484, 2000.

S. Pilato and R. Berwick, Reversible automata and induction of the English auxiliary system, Proceedings of the 23rd annual meeting on Association for Computational Linguistics -, pp.70-75, 1985.
DOI : 10.3115/981210.981219

L. Pitt, Inductive inference, DFA's, and computational complexity, AII '89: Proceedings of the International Workshop on Analogical and Inductive Inference, pp.18-44, 1989.

G. Pullum and B. Scholz, Empirical assessment of stimulus poverty arguments, The Linguistic Review, vol.18, issue.1-2, pp.9-50, 2002.
DOI : 10.1515/tlir.19.1-2.9

F. Reali and M. H. Christiansen, Structure dependence in language acquisition: Uncovering the statistical richness of the stimulus, Proceedings of the 26th Annual Conference of the Cognitive Science Society, 2004.

D. Ron, Y. Singer, and N. Tishby, On the Learnability and Usage of Acyclic Probabilistic Finite Automata, Journal of Computer and System Sciences, vol.56, issue.2, pp.133-152, 1998.
DOI : 10.1006/jcss.1997.1555

G. Sénizergues, The equivalence and inclusion problems for NTS languages, Journal of Computer and System Sciences, vol.31, issue.3, pp.303-331, 1985.
DOI : 10.1016/0022-0000(85)90055-8

Z. Solan, D. Horn, E. Ruppin, and S. Edelman, Unsupervised context sensitive language acquisition from a large corpus, Proceedings of NIPS 2003, 2004.

B. Starkie, Identifying Languages in the Limit using Alignment Based Learning, 2004.

M. Van-zaanen, Implementing Alignment-Based Learning, Grammatical Inference: Algorithms and Applications, ICGI, pp.312-314, 2002.
DOI : 10.1007/3-540-45790-9_30

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

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