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

Christophe Costa FlorĂȘncio. Consistent Identification in the Limit of Rigid Grammars from Strings Is NP-hard. In Pieter W. Adriaans, Henning Fernau, Menno van Zaanen, editors, Grammatical Inference: Algorithms and Applications, 6th International Colloquium: ICGI 2002, Amsterdam, The Netherlands, September 23-25, 2002, Proceedings. Volume 2484 of Lecture Notes in Computer Science, pages 49-62, Springer, 2002. [doi]

Abstract

Abstract is missing.