Inductive inference of languages from samplings

Authors:
Sanjay Jain;Efim Kinber
Affiliations:
School of Computing, National University of Singapore, Singapore, Republic of Singapore;Department of Computer Science, Sacred Heart University, Fairfield, CT
Venue:
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
Year:
2010

Citing 7
Cited 0

Systems that learn: an introduction to learning theory for cognitive and computer scientists

Systems that learn: an introduction to learning theory for cognitive and computer scientists
Theory of recursive functions and effective computability

Theory of recursive functions and effective computability
Prudence and other conditions on formal language learning

Information and Computation
A Machine-Independent Theory of the Complexity of Recursive Functions

Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Machine Inductive Inference and Language Identification

Proceedings of the 9th Colloquium on Automata, Languages and Programming
Learning and extending sublanguages

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.