Learning languages from positive data and a limited number of short counterexamples

DOI10.1016/J.TCS.2007.08.010MaRDI QIDQ2465639zbMATH OpenOpenAlexWikidataFDO

Authors Sanjay Jain, Efim Kinber

Publication date 7 January 2008

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2007.08.010

zbMATH Keywords

inductive inferencelearning in the limitpositive datacounterexamples

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Theory of programming languages (68N15)

Recommendations

• On Learning Languages from Positive Data and a Limited Number of Short Counterexamples
• Learning languages from positive data and negative counterexamples
• Algorithmic Learning Theory
• Learning from Positive Data and Negative Counterexamples: A Survey
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science

Cites work

• scientific article; zbMATH DE number 3932417 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Algorithmic Learning Theory
• Comparison of identification criteria for machine inductive inference
• Criteria of language learning
• Ignoring data may be the only way to learn efficiently
• Inductive inference from all positive and some negative data
• Iterative learning from positive data and negative counterexamples
• Language identification in the limit
• Language learning with some negative information
• Learning Theory
• Learning languages from positive data and a finite number of queries
• Prudence and other conditions on formal language learning
• Queries and concept learning
• Toward a mathematical theory of inductive inference

Cited in

(14)

• One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples
• Learning languages from positive data and a finite number of queries
• Learning indexed families of recursive languages from positive data: A survey
• Learning efficiency of very simple grammars from positive data
• Learning languages from positive data and negative counterexamples
• Learning from Positive Data and Negative Counterexamples: A Survey
• Language learning with some negative information
• Learning deterministic even linear languages from positive examples
• Negative data in learning languages
• On Learning Languages from Positive Data and a Limited Number of Short Counterexamples
• Algorithmic Learning Theory
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Automatic learning from positive data and negative counterexamples
• A family of languages which is polynomial-time learnable from positive data in pitt's sense

This page was built for publication: Learning languages from positive data and a limited number of short counterexamples

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