Distributional Learning of Some Context-Free Languages with a Minimally Adequate Teacher [chapter]

Alexander Clark
2010 Lecture Notes in Computer Science  
Angluin showed that the class of regular languages could be learned from a Minimally Adequate Teacher (mat) providing membership and equivalence queries. Clark and Eyraud (2007) showed that some context free grammars can be identified in the limit from positive data alone by identifying the congruence classes of the language. In this paper we consider learnability of context free languages using a mat. We show that there is a natural class of context free languages, that includes the class of
more » ... gular languages, that can be polynomially learned from a mat, using an algorithm that is an extension of Angluin's lstar algorithm.
doi:10.1007/978-3-642-15488-1_4 fatcat:rjydzjrgw5ajdnt2qtuxppji6i