Communications of the ACM
The acquisition of syntactic knowledge
The acquisition of syntactic knowledge
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
On the complexity of inductive inference
Information and Control
Learning regular sets from queries and counterexamples
Information and Computation
A polynomial-time algorithm for learning k-variable pattern languages from examples
COLT '89 Proceedings of the second annual workshop on Computational learning theory
Identification of unions of languages drawn from an identifiable class
COLT '89 Proceedings of the second annual workshop on Computational learning theory
Learning string patterns and tree patterns from examples
Proceedings of the seventh international conference (1990) on Machine learning
Polynomial-time inference of arbitrary pattern languages
New Generation Computing - Selected papers from the international workshop on algorithmic learning theory,1990
The correct definition of finite elasticity: corrigendum to identification of unions
COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
Machine learning: a theoretical approach
Machine learning: a theoretical approach
Equivalence of models for polynomial learnability
Information and Computation
Types of monotonic language learning and their characterization
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
On the power of inductive inference from good examples
Theoretical Computer Science
Language learning in dependence on the space of hypotheses
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Rich classes inferable from positive data
Information and Computation
Artificial intelligence: a modern approach
Artificial intelligence: a modern approach
An introduction to computational learning theory
An introduction to computational learning theory
Language learning from texts: mindchanges, limited memory, and monotonicity
Information and Computation
Monotonic and dual monotonic language learning
Theoretical Computer Science
Angluin's theorem for indexed families of r.e. sets and applications
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Incremental learning from positive data
Journal of Computer and System Sciences
Characteristic Sets for Polynomial Grammatical Inference
Machine Learning
Recent advances of grammatical inference
Theoretical Computer Science - Special issue on algorithmic learning theory
Theoretical Computer Science - Special issue on algorithmic learning theory
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
Learnability of a subclass of extended pattern languages
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
The synthesis of language learners
Information and Computation
Incremental concept learning for bounded data mining
Information and Computation
A Machine-Independent Theory of the Complexity of Recursive Functions
Journal of the ACM (JACM)
Inference of Reversible Languages
Journal of the ACM (JACM)
Learning languages and functions by erasing
Theoretical Computer Science - Special issue on algorithmic learning theory
An average-case optimal one-variable pattern language learner
Journal of Computer and System Sciences - Eleventh annual conference on computational learning theory&slash;Twelfth Annual IEEE conference on computational complexity
Synthesizing learners tolerating computable noisy data
Journal of Computer and System Sciences
On the learnability of recursively enumerable languages from good examples
Theoretical Computer Science
Synthesizing noise-tolerant language learners
Theoretical Computer Science
Theoretical Computer Science
Machine Learning
Generalization and specialization strategies for learning r.e. languages
Annals of Mathematics and Artificial Intelligence
Learning recursive languages from good examples
Annals of Mathematics and Artificial Intelligence
Annals of Mathematics and Artificial Intelligence
Stochastic Finite Learning of the Pattern Languages
Machine Learning
Machine Learning
Machine Learning
Polynomial Time Inference of Extended Regular Pattern Languages
Proceedings of RIMS Symposium on Software Science and Engineering
Characterization Problems in the Theory of Inductive Inference
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
Machine Inductive Inference and Language Identification
Proceedings of the 9th Colloquium on Automata, Languages and Programming
On synthesizing programs given by examples
Proceedings of the International Sympoisum on Theoretical Programming
A Guided Tour Across the Boundaries of Learning Recursive Languages
Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report
Typed pattern languages and their learnability
EuroCOLT '95 Proceedings of the Second European Conference on Computational Learning Theory
Inductive Inference, DFAs, and Computational Complexity
AII '89 Proceedings of the International Workshop on Analogical and Inductive Inference
Identifiability of Subspaces and Homomorphic Images of Zero-Reversible Languages
ALT '97 Proceedings of the 8th International Conference on Algorithmic Learning Theory
A Negative Result on Inductive Inference of Extended Pattern Languages
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
A Thesis in Inductive Inference
Proceedings of the 1st International Workshop on Nonmonotonic and Inductive Logic
Variants of iterative learning
Theoretical Computer Science
Polynomial-time identification of very simple grammars from positive data
Theoretical Computer Science - Selected papers in honour of Setsuo Arikawa
Inducing grammars from sparse data sets: a survey of algorithms and results
The Journal of Machine Learning Research
Theoretical Computer Science - Special issue: Algorithmic learning theory
Formal language identification: query learning vs. gold-style learning
Information Processing Letters
Formal languages and their relation to automata
Formal languages and their relation to automata
Relations between gold-style learning and query learning
Information and Computation
A non-learnable class of E-pattern languages
Theoretical Computer Science - Algorithmic learning theory(ALT 2002)
Pattern Recognition and Machine Learning (Information Science and Statistics)
Pattern Recognition and Machine Learning (Information Science and Statistics)
Learning erasing pattern languages with queries
Theoretical Computer Science - Algorithmic learning theory (ALT 2000)
From learning in the limit to stochastic finite learning
Theoretical Computer Science - Algorithmic learning theory
Discontinuities in pattern inference
Theoretical Computer Science
Learning recursive functions: A survey
Theoretical Computer Science
Developments from enquiries into the learnability of the pattern languages from positive data
Theoretical Computer Science
Learning Efficiency of Very Simple Grammars from Positive Data
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
A bibliographical study of grammatical inference
Pattern Recognition
Towards a better understanding of incremental learning
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
Identification in the limit of substitutable context-free languages
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Learning recursive functions: A survey
Theoretical Computer Science
Learning with Temporary Memory
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
Identification in the Limit of k,l-Substitutable Context-Free Languages
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
One-shot learners using negative counterexamples and nearest positive examples
Theoretical Computer Science
On some open problems in monotonic and conservative learning
Information Processing Letters
Incremental learning with temporary memory
Theoretical Computer Science
Iterative learning from texts and counterexamples using additional information
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
Automatic learning of subclasses of pattern languages
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Set systems: Order types, continuous nondeterministic deformations, and quasi-orders
Theoretical Computer Science
Automatic learners with feedback queries
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Robust learning of automatic classes of languages
ALT'11 Proceedings of the 22nd international conference on Algorithmic learning theory
ALT'11 Proceedings of the 22nd international conference on Algorithmic learning theory
Learnability of co-r.e. classes
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
On the amount of nonconstructivity in learning formal languages from positive data
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Learning in the limit with lattice-structured hypothesis spaces
Theoretical Computer Science
Automatic functions, linear time and learning
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Automatic learning of subclasses of pattern languages
Information and Computation
Automatic learners with feedback queries
Journal of Computer and System Sciences
Robust learning of automatic classes of languages
Journal of Computer and System Sciences
| Hi-index | 5.23 |
In the past 40 years, research on inductive inference has developed along different lines, e.g., in the formalizations used, and in the classes of target concepts considered. One common root of many of these formalizations is Gold's model of identification in the limit. This model has been studied for learning recursive functions, recursively enumerable languages, and recursive languages, reflecting different aspects of machine learning, artificial intelligence, complexity theory, and recursion theory. One line of research focuses on indexed families of recursive languages - classes of recursive languages described in a representation scheme for which the question of membership for any string in any of the given languages is effectively decidable with a uniform procedure. Such language classes are of interest because of their naturalness. The survey at hand picks out important studies on learning indexed families (including basic as well as recent research), summarizes and illustrates the corresponding results, and points out links to related fields such as grammatical inference, machine learning, and artificial intelligence in general.