Types of monotonic language learning and their characterization
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Logic program synthesis from incomplete specifications
Journal of Symbolic Computation - Special issue on automatic programming
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
DNF—if you can't learn'em, teach'em: an interactive model of teaching
COLT '95 Proceedings of the eighth 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
Exact learning of tree patterns from queries and counterexamples
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Learning one-variable pattern languages in linear average time
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Theoretical Computer Science
On Exact Learning of Unordered Tree Patterns
Machine Learning
Learning recursive languages from good examples
Annals of Mathematics and Artificial Intelligence
Finding tree patterns consistent with positive and negative examples using queries
Annals of Mathematics and Artificial Intelligence
Annals of Mathematics and Artificial Intelligence
Stochastic Finite Learning of the Pattern Languages
Machine Learning
On learning unions of pattern languages and tree patterns in the mistake bound model
Theoretical Computer Science
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
Consistent Identification in the Limit of Any of the Classes k -Valued Is NP-hard
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
SAGA '01 Proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications
Consistent Polynominal Identification in the Limit
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
On Learning Unions of Pattern Languages and Tree Patterns
ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory
Learning Erasing Pattern Languages with Queries
ALT '00 Proceedings of the 11th 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 non-learnable class of E-pattern languages
Theoretical Computer Science - Algorithmic learning theory(ALT 2002)
Inductive inference of approximations for recursive concepts
Theoretical Computer Science - Algorithmic learning theory (ALT 2000)
Learning erasing pattern languages with queries
Theoretical Computer Science - Algorithmic learning theory (ALT 2000)
Variations on U-shaped learning
Information and Computation
From learning in the limit to stochastic finite learning
Theoretical Computer Science - Algorithmic learning theory
Learning a subclass of regular patterns in polynomial time
Theoretical Computer Science - Algorithmic learning theory
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
U-shaped, iterative, and iterative-with-counter learning
Machine Learning
Parallelism Increases Iterative Learning Power
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
Learning Efficiency of Very Simple Grammars from Positive Data
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
Iterative Learning of Simple External Contextual Languages
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
On Learning Regular Expressions and Patterns Via Membership and Correction Queries
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Learning efficiency of very simple grammars from positive data
Theoretical Computer Science
Parallelism increases iterative learning power
Theoretical Computer Science
Iterative learning of simple external contextual languages
Theoretical Computer Science
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
Regular patterns, regular languages and context-free languages
Information Processing Letters
Automatic learning of subclasses of pattern languages
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Inductive inference and language learning
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Unambiguous morphic images of strings
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Variations on u-shaped learning
COLT'05 Proceedings of the 18th annual conference on Learning Theory
Learnability of automatic classes
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
String extension learning using lattices
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Polynomial-Time algorithms for learning typed pattern languages
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Patterns with bounded treewidth
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Regular and context-free pattern languages over small alphabets
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Learning in the limit with lattice-structured hypothesis spaces
Theoretical Computer Science
Learnability of automatic classes
Journal of Computer and System Sciences
Automatic learning of subclasses of pattern languages
Information and Computation
Theoretical Computer Science
Inferring descriptive generalisations of formal languages
Journal of Computer and System Sciences
Regular and context-free pattern languages over small alphabets
Theoretical Computer Science
| Hi-index | 0.01 |