On the complexity of inductive inference
Information and Control
Prudence and other conditions on formal language learning
Information and Computation
Polynomial-time inference of arbitrary pattern languages
New Generation Computing - Selected papers from the international workshop on algorithmic learning theory,1990
An introduction to computational learning theory
An introduction to computational learning theory
Learnable classes of categorial grammars
Learnable classes of categorial grammars
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On the Complexity of Consistent Identification of Some Classes of Structure Languages
ICGI '00 Proceedings of the 5th 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
Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report
A Guided Tour Across the Boundaries of Learning Recursive Languages
Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report
Inductive Inference, DFAs, and Computational Complexity
AII '89 Proceedings of the International Workshop on Analogical and Inductive Inference
Consistent Polynominal Identification in the Limit
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Finding patterns common to a set of strings (Extended Abstract)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Enumerative Combinatorics: Volume 1
Enumerative Combinatorics: Volume 1
Robust Learning - Rich and Poor
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
How to Split Recursive Automata
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
A bibliographical study of grammatical inference
Pattern Recognition
When categorial grammars meet regular grammatical inference
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
Finding consistent categorial grammars of bounded value: a parameterized approach
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Theoretical Computer Science
| Hi-index | 0.00 |
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. The 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.