Learning languages from positive data and a limited number of short counterexamples
From MaRDI portal
Publication:2465639
DOI10.1016/J.TCS.2007.08.010zbMATH Open1154.68467OpenAlexW3023745670WikidataQ124802613 ScholiaQ124802613MaRDI QIDQ2465639FDOQ2465639
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
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
Learning and adaptive systems in artificial intelligence (68T05) Theory of programming languages (68N15)
Cites Work
- Queries and concept learning
- Title not available (Why is that?)
- Toward a mathematical theory of inductive inference
- Criteria of language learning
- Title not available (Why is that?)
- Language identification in the limit
- Prudence and other conditions on formal language learning
- Comparison of identification criteria for machine inductive inference
- Ignoring data may be the only way to learn efficiently
- Iterative learning from positive data and negative counterexamples
- Algorithmic Learning Theory
- Inductive inference from all positive and some negative data
- Language learning with some negative information
- Learning languages from positive data and a finite number of queries
- Learning Theory
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)
