Consistent Identification in the Limit of Any of the Classes k -Valued Is NP-hard

Christophe Costa FlorĂȘncio. Consistent Identification in the Limit of Any of the Classes k -Valued Is NP-hard. In Philippe de Groote, Glyn Morrill, Christian RetorĂ©, editors, Logical Aspects of Computational Linguistics, 4th International Conference, LACL 2001, Le Croisic, France, June 27-29, 2001, Proceedings. Volume 2099 of Lecture Notes in Computer Science, pages 125-138, Springer, 2001. [doi]

Abstract

Abstract is missing.