Language learning with some negative information

DOI10.1006/jcss.1995.1066zbMath0831.68084OpenAlexW1984060850MaRDI QIDQ1900931

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)

Related Items (12)

On the Influence of Technology on Learning Processes ⋮ On the learnability of vector spaces ⋮ Learning from Positive Data and Negative Counterexamples: A Survey ⋮ When unlearning helps ⋮ Learning by switching type of information. ⋮ Non-U-shaped vacillatory and team learning ⋮ 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 ⋮ Learning languages from positive data and a finite number of queries ⋮ On the learnability of recursively enumerable languages from good examples ⋮ The synthesis of language learners.

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