scientific article

zbMATH Open0869.68073MaRDI QIDQ3126929FDOQ3126929

Takeshi Shinohara, Ayumi Shinohara, Satoru Miyano

Publication date: 3 April 1997

Title of this publication is not available (Why is that?)

zbMATH Keywords

elementary formal systemspolynomial-time learnability

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cited In (14)

• On a generalized notion of mistake bounds
• A practical algorithm to find the best subsequence patterns
• Logical settings for concept-learning
• On the complexity of deriving position specific score matrices from positive and negative sequences
• On learning unions of pattern languages and tree patterns in the mistake bound model.
• Recent advances of grammatical inference
• Learning Tree Languages
• Grammatical inference: An old and new paradigm
• Incremental learning of logic programs
• Mind change complexity of learning logic programs
• Learning elementary formal systems with queries.
• Some classes of Prolog programs inferable from positive data
• A framework for incremental learning of logic programs
• A machine discovery from amino acid sequences by decision trees over regular patterns

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3126929)