Consistent Identification in the Limit of Rigid Grammars from Strings Is NP-hard [chapter]

Christophe Costa Florêncio
2002 Lecture Notes in Computer Science  
In [Bus87] and [BP90] some 'discovery procedures' for classical categorial grammars were defined. These procedures take a set of structures (strings labeled with derivational information) as input and yield a set of hypotheses in the form of grammars. In [Kan98] learning functions based on these discovery procedures were studied, and it was shown that some of the classes associated with these functions can be identified in the limit (i.e. are learnable) from strings, by a computable function.
more » ... e time complexity of these functions however was still left an open question. In this paper we will show that the learning functions for these learnable classes are all NP-hard.
doi:10.1007/3-540-45790-9_5 fatcat:s2kt6u7fubbvvcvud35jmk52ay