Language learning with some negative information

DOI10.1006/JCSS.1995.1066zbMATH Open0831.68084OpenAlexW1984060850MaRDI QIDQ1900931FDOQ1900931

Sanjay Jain, John Case, Ganesh R. Baliga

Publication date: 25 October 1995

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1995.1066

zbMATH Keywords

learning machinesgold-style language learning

Mathematics Subject Classification ID

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

Cited In (13)

• Learning languages from positive data and a limited number of short counterexamples
• Learning languages from positive data and a finite number of queries
• On the Influence of Technology on Learning Processes
• The synthesis of language learners.
• When unlearning helps
• On the learnability of recursively enumerable languages from good examples
• Learning languages from positive data and negative counterexamples
• On the learnability of vector spaces
• Learning from Positive Data and Negative Counterexamples: A Survey
• Learning by switching type of information.
• Title not available (Why is that?)
• Iterative learning from positive data and negative counterexamples
• Non-U-shaped vacillatory and team learning

This page was built for publication: Language learning with some negative information

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