Finding Minimal Generalizations for Unions of Pattern Languages and Its Application to Inductive Inference from Positive Data

Finding tree patterns consistent with positive and negative examples using queries

Annals of Mathematics and Artificial Intelligence

Characteristic Sets for Unions of Regular Pattern Languages and Compactness

ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory

A Fast Algorithm for Discovering Optimal String Patterns in Large Text Databases

ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory

Efficient Learning of Semi-structured Data from Queries

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

Ordered Term Tree Languages which Are Polynomial Time Inductively Inferable from Positive Data

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

Refutable/Inductive Learning from Neighbor Examples and Its Application to Decision Trees over Patterns

Progress in Discovery Science, Final Report of the Japanese Discovery Science Project

Discovering Characteristic Patterns from Collections of Classical Japanese Poems

DS '98 Proceedings of the First International Conference on Discovery Science

Polynomial Time Inductive Inference of Ordered Tree Patterns with Internal Structured Variables from Positive Data

COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory

Learning elementary formal systems with queries

Theoretical Computer Science - Selected papers in honour of Setsuo Arikawa

Ordered term tree languages which are polynomial time inductively inferable from positive data

Theoretical Computer Science - Algorithmic learning theory(ALT 2002)

Learning languages in a union

Journal of Computer and System Sciences

Learning of erasing primitive formal systems from positive examples

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

Mining maximal flexible patterns in a sequence

JSAI'07 Proceedings of the 2007 conference on New frontiers in artificial intelligence

Finding consensus patterns in very scarce biosequence samples from their minimal multiple generalizations

PAKDD'06 Proceedings of the 10th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining

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

Best fitting fixed-length substring patterns for a set of strings

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics

A polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation

Measuring over-generalization in the minimal multiple generalizations of biosequences

DS'05 Proceedings of the 8th international conference on Discovery Science

Characteristic sets for inferring the unions of the tree pattern languages by the most fitting hypotheses

ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications

Inferring descriptive generalisations of formal languages

Journal of Computer and System Sciences