Inductive inference from all positive and some negative data

DOI10.1016/0020-0190(91)90176-IMaRDI QIDQ1182096zbMATH OpenFDO

Authors Tatsuya Motoki

Publication date 27 June 1992

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2433/82119

zbMATH Keywords

computational learningidentification in the limitinductive inference of formal languagesusefulness of negative data

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• scientific article; zbMATH DE number 3976382
• Negative data in learning languages
• scientific article; zbMATH DE number 3956468
• Learning languages from positive data and negative counterexamples
• Learning languages from positive data and negative counterexamples

Cites work

• Inductive inference of formal languages from positive data
• Inductive inference of unbounded unions of pattern languages from positive data
• Language identification in the limit

Cited in

(8)

• Learning by switching type of information.
• Iterative learning from positive data and negative counterexamples
• Learning languages from positive data and a limited number of short counterexamples
• scientific article; zbMATH DE number 3956468 (Why is no real title available?)
• scientific article; zbMATH DE number 3976382 (Why is no real title available?)
• On the learnability of recursively enumerable languages from good examples
• On the learnability of vector spaces
• Learning languages from positive data and negative counterexamples

This page was built for publication: Inductive inference from all positive and some negative data

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