Inductive Inference of Unbounded Unions of Pattern Languages from Positive Data

Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries

Theoretical Computer Science

Compactness and Learning of Classes of Unions of Erasing Regular Pattern Languages

ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory

Decision lists over regular patterns

Theoretical Computer Science - Selected papers in honour of Setsuo Arikawa

From learning in the limit to stochastic finite learning

Theoretical Computer Science - Algorithmic learning theory