论文信息 - Inductive Inference of Languages from Samplings

Inductive Inference of Languages from Samplings

We introduce, discuss, and study a model for inductive inference from samplings, formalizing an idea of learning different "projections" of languages. One set of our results addresses the problem of finding a uniform learner for all samplings of a language from a certain set when learners for particular samplings are available. Another set of results deals with extending learnability from a large natural set of samplings to larger sets. A number of open problems is formulated.

Sanjay Jain | Efim B. Kinber

[1] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .

[2] John Case,et al. Machine Inductive Inference and Language Identification , 1982, ICALP.

[3] E. Mark Gold,et al. Language Identification in the Limit , 1967, Inf. Control..

[4] Sanjay Jain,et al. Learning and Extending Sublanguages , 2006, ALT.

[5] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.

[6] D. C. Cooper,et al. Theory of Recursive Functions and Effective Computability , 1969, The Mathematical Gazette.

[7] Manuel Blum,et al. A Machine-Independent Theory of the Complexity of Recursive Functions , 1967, JACM.

[8] Daniel N. Osherson,et al. Systems That Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists , 1990 .

[9] Manuel Blum,et al. Toward a Mathematical Theory of Inductive Inference , 1975, Inf. Control..

[10] Daniel N. Osherson,et al. Criteria of Language Learning , 1982, Inf. Control..

[11] Mark A. Fulk. Prudence and Other Conditions on Formal Language Learning , 1990, Inf. Comput..

[12] John Case,et al. Comparison of Identification Criteria for Machine Inductive Inference , 1983, Theor. Comput. Sci..

[13] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .