Synthesizing enumeration techniques for language learning
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Angluin's theorem for indexed families of r.e. sets and applications
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Aspects of complexity of conservative probabilistic learning
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
On the learnability of recursively enumerable languages from good examples
Theoretical Computer Science
Synthesizing noise-tolerant language learners
Theoretical Computer Science
Theoretical Computer Science
Learning algebraic structures from text
Theoretical Computer Science - Algorithmic learning theory
Aspects of complexity of probabilistic learning under monotonicity constraints
Theoretical Computer Science - Algorithmic learning theory
Control structures in hypothesis spaces: the influence on learning
Theoretical Computer Science
Stochastic Finite Learning of the Pattern Languages
Machine Learning
On the power of incremental learning
Theoretical Computer Science
Consistent Identification in the Limit of Rigid Grammars from Strings Is NP-hard
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Synthesizing Learners Tolerating Computable Noisy Data
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Learning Algebraic Structures from Text Using Semantical Knowledge
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Finding a One-Variable Pattern from Incomplete Data
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
On the Strength of Incremental Learning
ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory
Learning Recursive Concepts with Anomalies
ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
Extending Elementary Formal Systems
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
Inferring a Rewriting System from Examples
DS '98 Proceedings of the First International Conference on Discovery Science
On Variants of Iterative Learning
DS '98 Proceedings of the First International Conference on Discovery Science
A Unifying Approach to HTML Wrapper Representation and Learning
DS '00 Proceedings of the Third International Conference on Discovery Science
PAC Learning from Positive Statistical Queries
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Variants of iterative learning
Theoretical Computer Science
Advanced elementary formal systems
Theoretical Computer Science - Selected papers in honour of Setsuo Arikawa
Decision lists over regular patterns
Theoretical Computer Science - Selected papers in honour of Setsuo Arikawa
Classes with easily learnable subclasses
Information and Computation
On the classification of recursive languages
Information and Computation
Formal language identification: query learning vs. gold-style learning
Information Processing Letters
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)
Learning languages from positive data and a finite number of queries
Information and Computation
Inductive inference of approximations for recursive concepts
Theoretical Computer Science - Algorithmic learning theory (ALT 2000)
The Intrinsic Complexity of Learning: A Survey
Fundamenta Informaticae
From learning in the limit to stochastic finite learning
Theoretical Computer Science - Algorithmic learning theory
Some natural conditions on incremental learning
Information and Computation
A general comparison of language learning from examples and from queries
Theoretical Computer Science
Iterative learning from positive data and negative counterexamples
Information and Computation
Learning languages from positive data and a limited number of short counterexamples
Theoretical Computer Science
Learning indexed families of recursive languages from positive data: A survey
Theoretical Computer Science
Discontinuities in pattern inference
Theoretical Computer Science
Developments from enquiries into the learnability of the pattern languages from positive data
Theoretical Computer Science
Learning in Friedberg numberings
Information and Computation
Prescribed Learning of Indexed Families
Fundamenta Informaticae
Characterizing Programming Systems Allowing Program Self-reference
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Prescribed Learning of R.E. Classes
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
Learning in Friedberg Numberings
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
Algorithms for learning regular expressions from positive data
Information and Computation
Prescribed learning of r.e. classes
Theoretical Computer Science
Learning efficiency of very simple grammars from positive data
Theoretical Computer Science
Hypothesis Spaces for Learning
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory 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
Necessary and sufficient conditions for learning with correction queries
Theoretical Computer Science
Relations between Gold-style learning and query learning
Information and Computation
Learning languages from positive data and a finite number of queries
Information and Computation
A characterization of the language classes learnable with correction queries
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Hypothesis spaces for learning
Information and Computation
Iterative learning from positive data and negative counterexamples
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
Towards a better understanding of incremental learning
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
Gold-style and query learning under various constraints on the target class
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
On learning languages from positive data and a limited number of short counterexamples
COLT'06 Proceedings of the 19th annual conference on Learning Theory
Inductive inference and language learning
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Learning languages from positive data and a finite number of queries
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
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
Prescribed Learning of Indexed Families
Fundamenta Informaticae
The Intrinsic Complexity of Learning: A Survey
Fundamenta Informaticae
Hi-index | 0.01 |