Probabilistic learnability of context-free grammars with basic distributional properties from positive examples

Angluin, 1987, Learning regular sets from queries and counterexamples, Inform. and Comput., 75, 87, 10.1016/0890-5401(87)90052-6 Boasson, 1985, NTS languages are deterministic and congruential, J. Comput. System Sci., 31, 332, 10.1016/0022-0000(85)90056-X Clark, 2006, PAC-learning unambiguous NTS languages, vol. 4201, 59 Clark, 2010, Distributional learning of some context-free languages with a minimally adequate teacher, vol. 6339, 24 Clark, 2010, Learning context free grammars with the syntactic concept lattice, vol. 6339, 38 Clark, 2011, A learnable representation for syntax using residuated lattices, vol. 5591, 183 Clark, 2007, Polynomial identification in the limit of substitutable context-free languages, J. Mach. Learn. Res., 8, 1725 Clark, 2010, Using contextual representations to efficiently learn context-free languages, J. Mach. Learn. Res., 11, 2707 Clark, 2004, PAC-learnability of probabilistic deterministic finite state automata, J. Mach. Learn. Res., 5, 473 Clark, 2004, Partially distribution-free learning of regular languages from positive samples, 85 Clark, 2014, Distributional learning of parallel multiple context-free grammars, Mach. Learn., 96, 5, 10.1007/s10994-013-5403-2 Harris, 1954, Distributional structure, Word, 10, 146, 10.1080/00437956.1954.11659520 Kearns, 1994, Cryptographic limitations on learning Boolean formulae and finite automata, J. ACM, 41, 67, 10.1145/174644.174647 Luque, 2010, PAC-learning unambiguous k,l-NTS≤ languages, vol. 6339, 122 Mitzenmacher, 2005 Sénizergues, 1985, The equivalence and inclusion problems for NTS languages, J. Comput. System Sci., 31, 303, 10.1016/0022-0000(85)90055-8 Shibata, 2013, PAC learning of some subclasses of context-free grammars with basic distributional properties from positive data, vol. 8139, 143 Shirakawa, 1993, Polynomial-time MAT learning of c-deterministic context-free grammars, IPSJ J., 34, 380 Tajima, 2008, Polynomial time probabilistic learning of a subclass of linear languages with queries, vol. 5278, 187 Leslie, 1984, A theory of the learnable, Commun. ACM, 27, 1134, 10.1145/1968.1972 Yoshinaka, 2008, Identification in the limit of k,l-substitutable context-free languages, vol. 5278, 266 Yoshinaka, 2011, Efficient learning of multiple context-free languages with multidimensional substitutability from positive data, Theoret. Comput. Sci., 412, 1821, 10.1016/j.tcs.2010.12.058 Yoshinaka, 2011, Towards dual approaches for learning context-free grammars based on syntactic concept lattices, vol. 6795, 429 Yoshinaka, 2012, Integration of the dual approaches in the distributional learning of context-free grammars, vol. 7183, 538