Learning shallow context-free languages under simple distributions, Algebras, Diagrams and Decisions in Language, Logic and Computation, 2002. ,
Towards High Speed Grammar Induction on Large Text Corpora, SOFSEM 2000, pp.173-186, 2000. ,
DOI : 10.1007/3-540-44411-4_11
Inference of Reversible Languages, Journal of the ACM, vol.29, issue.3, pp.741-765, 1982. ,
DOI : 10.1145/322326.322334
String Rewriting Systems, 1993. ,
Systems of syntactic analysis, The Journal of Symbolic Logic, vol.15, issue.03, pp.242-256, 1953. ,
DOI : 10.2307/409987
Structure Dependence in Grammar Formation, Language, vol.63, issue.3, pp.522-543, 1987. ,
DOI : 10.2307/415004
Characteristic sets for polynomial grammatical inference, Machine Learning, pp.125-138, 1997. ,
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
Language identification in the limit, Information and Control, vol.10, issue.5, pp.447-474, 1967. ,
DOI : 10.1016/S0019-9958(67)91165-5
Non-robustness of syntax acquisition from n-grams: A cross-linguistic perspective, The 18th Annual CUNY Sentence Processing Conference, 2005. ,
Inference of a subclass of context free grammars using positive samples, Proceedings of the Workshop on Learning Context-Free, 2003. ,
Word Problems and Confluence Problems for Restricted Semi-Thue Systems, RTA, pp.172-186, 2000. ,
DOI : 10.1007/10721975_12
On inferring zero-reversible languages, Acta Cybernetica, vol.14, pp.479-484, 2000. ,
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
Inductive inference, DFA's, and computational complexity, AII '89: Proceedings of the International Workshop on Analogical and Inductive Inference, pp.18-44, 1989. ,
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
Structure dependence in language acquisition: Uncovering the statistical richness of the stimulus, Proceedings of the 26th Annual Conference of the Cognitive Science Society, 2004. ,
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
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
Unsupervised context sensitive language acquisition from a large corpus, Proceedings of NIPS 2003, 2004. ,
Identifying Languages in the Limit using Alignment Based Learning, 2004. ,
Implementing Alignment-Based Learning, Grammatical Inference: Algorithms and Applications, ICGI, pp.312-314, 2002. ,
DOI : 10.1007/3-540-45790-9_30
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. ,
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