Inductive inference of unbounded unions of pattern languages from positive data

Learning Languages in a Union

ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory

Prediction-Preserving Reducibility with Membership Queries on Formal Languages

FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory

Learning elementary formal systems with queries

Theoretical Computer Science - Selected papers in honour of Setsuo Arikawa

Learnability of term rewrite systems from positive examples

CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51

Learning languages in a union

Journal of Computer and System Sciences

Learning a subclass of regular patterns in polynomial time

Theoretical Computer Science - Algorithmic learning theory

Some classes of term rewriting systems inferable from positive data

Theoretical Computer Science

Developments from enquiries into the learnability of the pattern languages from positive data

Theoretical Computer Science

Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data

Theoretical Computer Science

Inferability of closed set systems from positive data

JSAI'06 Proceedings of the 20th annual conference on New frontiers in artificial intelligence

Inferability of unbounded unions of certain closed set systems

JSAI-isAI'09 Proceedings of the 2009 international 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

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

A class of prolog programs with non-linear outputs inferable from positive data

ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory

Finite automata and unions of regular patterns with bounded constant segments

CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata

Learnability of term rewrite systems from positive examples

CATS '06 Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51