Inductive inference from all positive and some negative data

DOI10.1016/0020-0190(91)90176-IzbMath0735.68071MaRDI QIDQ1182096

Tatsuya Motoki

Publication date: 27 June 1992

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Related Items (6)

On the learnability of vector spaces ⋮ Learning by switching type of information. ⋮ Learning languages from positive data and negative counterexamples ⋮ Iterative learning from positive data and negative counterexamples ⋮ Learning languages from positive data and a limited number of short counterexamples ⋮ On the learnability of recursively enumerable languages from good examples

Cites Work

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

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