Consistent identification in the limit of some of Penn and Buszkowski s classes is NP-hard

Christophe Costa FlorĂȘncio. Consistent identification in the limit of some of Penn and Buszkowski s classes is NP-hard. In Paola Monachesi, editor, Computational Linguistics in the Netherlands 1999, Selected Papers from the Tenth CLIN Meeting, December 10, OTS Utrecht. UILOTS Utrecht, 1999. [doi]

Abstract

Abstract is missing.