|
793
|
Language identification in the limit
– E M Gold
- 1967
|
|
439
|
Learning regular sets from queries and counterexamples
– D Angluin
- 1987
|
|
195
|
Complexity of automaton identification from given data
– E Gold
- 1978
|
|
96
|
Inferring Regular Languages in Polynomial Update Time
– J Oncina, P Garcia
- 1992
|
|
1515
|
A Theory of the Learnable
– L. G. Valiant
- 1984
|
|
36
|
Grammatical inference: Introduction and survey
– K S Fu, T L Booth
- 1975
|
|
88
|
On the complexity of minimum inference of regular sets
– Dana Angluin
- 1978
|
|
286
|
Inductive inference: Theory and methods
– D ANGLUIN, C H SMITH
- 1983
|
|
114
|
Learning Stochastic Regular Grammars by Means of a State Merging Method
– Rafael C. Carrasco, Jose Oncina
- 1994
|
|
6
|
Regular Inference with a Tail-Clustering Method
– Laurent Miclet
- 1980
|
|
112
|
Inducing Probabilistic Grammars by Bayesian Model Merging
– Andreas Stolcke, Stephen Omohundro
- 1994
|
|
279
|
Cryptographic Limitations on Learning Boolean Formulae and Finite Automata
– Michael Kearns, Leslie Valiant
- 1989
|
|
73
|
The minimum consistent DFA problem cannot be approximated within any polynomial
– Leonard Pitt, Manfred K. Warmuth
- 1993
|
|
460
|
Wrapper Induction for Information Extraction
– Nicholas Kushmerick
- 1997
|
|
296
|
Learning Information Extraction Rules for Semi-structured and Free Text
– Stephen Soderland, Claire Cardie, Raymond Mooney
- 1999
|
|
39
|
Learnability by fixed distributions
– G Benedek, A Itai
- 1988
|
|
250
|
Towards a Mathematical Theory of Inductive Inference
– L Blum, M Blum
- 1975
|
|
279
|
A Scalable Comparison-Shopping Agent for the World-Wide Web
– Robert B. Doorenbos, Oren Etzioni, Daniel S. Weld
- 1997
|
|
274
|
Inductive inference of formal languages from positive data
– D Angluin
- 1980
|
