On the Complexity of Consistent Identification of Some Classes of Structure Languages

Authors:
Christophe Costa Florêcio
Affiliations:
-
Venue:
ICGI '00 Proceedings of the 5th International Colloquium on Grammatical Inference: Algorithms and Applications
Year:
2000

Citing 0
Cited 2

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

ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Consistent Identification in the Limit of Any of the Classes k -Valued Is NP-hard

LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract