scientific article; zbMATH DE number 1351089

MaRDI QIDQ4267809zbMATH OpenFDO

Authors Yasuhito Mukouchi

Publication date 24 October 1999

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Automata and formal grammars in connection with logical questions (03D05) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20)

Recommendations

• INDUCTIVE INFERENCE OF LIMITING PROGRAMS WITH BOUNDED NUMBER OF MIND CHANGES
• Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data
• Mind Change Complexity of Inferring Unbounded Unions of Pattern Languages from Positive Data
• scientific article; zbMATH DE number 512873

Cited in

(9)

• Mind change efficient learning
• Mind Change Complexity of Inferring Unbounded Unions of Pattern Languages from Positive Data
• Machine induction without revolutionary paradigm shifts
• scientific article; zbMATH DE number 67620 (Why is no real title available?)
• scientific article; zbMATH DE number 1960352 (Why is no real title available?)
• Probabilistic language learning under monotonicity constraints
• Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data
• LEARNING RECURSIVE LANGUAGES WITH BOUNDED MIND CHANGES
• Necessary and sufficient conditions for learning with correction queries

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 Q4267809)