|
193
|
Finding patterns common to a set of strings
– D Angluin
- 1980
|
|
274
|
Inductive inference of formal languages from positive data
– D Angluin
- 1980
|
|
32
|
On the role of procrastination for machine learning
– R Freivalds, C H Smith
- 1993
|
|
793
|
Language identification in the limit
– E M Gold
- 1967
|
|
714
|
Theory of recursive functions and effective computability, McGraw-Hill
– H Rogers
- 1967
|
|
10
|
Not-so-nearly-minimal-size program inference
– J Case, S Jain, M Suraj
- 1995
|
|
161
|
Comparison of Identification Criteria for Machine Inductive Inference. Theoret
– J Case, C Smith
- 1983
|
|
17
|
Ordinal Mind Change Complexity of Language Identification
– A Ambainis, S Jain, A Sharma
- 1997
|
|
7
|
Power of procrastination in inductive inference: How it depends on used ordinal notations
– A Ambainis
- 1995
|
|
64
|
On notation for ordinal numbers
– S C Kleene
- 1938
|
|
28
|
Identification of unions of languages drawn from an identifiable class
– K Wright
- 1989
|
|
17
|
Which classes of elementary formal systems are polynomial-time learnable
– S Miyano, A Shinohara, T Shinohara
- 1991
|
|
75
|
A machine independent theory of the complexity of recursive functions
– M Blum
- 1967
|
|
41
|
Incremental concept learning for bounded data mining
– Sanjay Jain, Steffen Lange, Thomas Zeugmann
- 1999
|
|
250
|
Towards a Mathematical Theory of Inductive Inference
– L Blum, M Blum
- 1975
|
|
98
|
An Introduction to the General Theory of Algorithms
– M MACHTEY, P YOUNG
- 1978
|
|
11
|
Generalized Notions of Mind Change Complexity
– Arun Sharma, Frank Stephan, Yuri Ventsov
- 1997
|
|
86
|
Higher recursion theory
– Gerald E Sacks
- 1990
|
|
29
|
Polynomial-time Learning of Elementary Formal Systems
– Satoru Miyano, Ayumi Shinohara, Takeshi Shinohara
- 2000
|
