Elementary formal systems, intrinsic complexity, and procrastination
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
Extensional set learning (extended abstract)
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
Characteristic Sets for Unions of Regular Pattern Languages and Compactness
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
Compactness and Learning of Classes of Unions of Erasing Regular Pattern Languages
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
Language Learning with a Neighbor System
DS '00 Proceedings of the Third International Conference on Discovery Science
Identification of function distinguishable languages
Theoretical Computer Science
k-Valued non-associative Lambek grammars are learnable from generalized functor-argument structures
Theoretical Computer Science - Logic, language, information and computation
Mind change efficient learning
Information and Computation
The Intrinsic Complexity of Learning: A Survey
Fundamenta Informaticae
Journal of Computer and System Sciences
Learning of erasing primitive formal systems from positive examples
Theoretical Computer Science - Algorithmic learning theory
Learning indexed families of recursive languages from positive data: A survey
Theoretical Computer Science
Developments from enquiries into the learnability of the pattern languages from positive data
Theoretical Computer Science
Topological Properties of Concept Spaces
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
Learning Node Label Controlled Graph Grammars (Extended Abstract)
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Commutative Regular Shuffle Closed Languages, Noetherian Property, and Learning Theory
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Mind change efficient learning
Information and Computation
Theoretical Computer Science
Topological properties of concept spaces (full version)
Information and Computation
Inferability of closed set systems from positive data
JSAI'06 Proceedings of the 20th annual conference on New frontiers in artificial intelligence
Computing characteristic sets of bounded unions of polynomial ideals
JSAI'07 Proceedings of the 2007 conference on New frontiers in artificial intelligence
Learning from positive data based on the MINL strategy with refinement operators
JSAI-isAI'09 Proceedings of the 2009 international conference on New frontiers in artificial intelligence
Set systems: Order types, continuous nondeterministic deformations, and quasi-orders
Theoretical Computer Science
Mind change complexity of inferring unbounded unions of pattern languages from positive data
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
Inferring unions of the pattern languages by the most fitting covers
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
Mind change efficient learning
COLT'05 Proceedings of the 18th annual conference on Learning Theory
Learnable classes of general combinatory grammars
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
Planar languages and learnability
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Inductive logic programming: yet another application of logic
INAP'05 Proceedings of the 16th international conference on Applications of Declarative Programming and Knowledge Management
Theoretical Computer Science
Two models of learning iterated dependencies
FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar
The Intrinsic Complexity of Learning: A Survey
Fundamenta Informaticae
| Hi-index | 0.01 |