Automatic learning from positive data and negative counterexamples

DOI10.1016/j.ic.2017.05.002zbMath1377.68096OpenAlexW4249441655WikidataQ124792156 ScholiaQ124792156MaRDI QIDQ2013555

Sanjay Jain, Frank Stephan, E. B. Kinber

Publication date: 8 August 2017

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2017.05.002

zbMATH Keywords

inductive inferenceiterative learningautomatic classeslearning in the limitcounterexample learning

Mathematics Subject Classification ID

Computational learning theory (68Q32) Algebraic theory of languages and automata (68Q70) Descriptive complexity and finite models (68Q19)

Related Items

Learning from Positive Data and Negative Counterexamples: A Survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Closed choice and a uniform low basis theorem
• Distributional learning of parallel multiple context-free grammars
• A machine discovery from amino acid sequences by decision trees over regular patterns
• Monotonic and non-monotonic inductive inference
• Polynomial inference of universal automata from membership and equivalence queries
• Learning languages from positive data and negative counterexamples
• Finding patterns common to a set of strings
• Learning regular languages from counterexamples
• Learning elementary formal systems
• Analogical and inductive inference. International workshop AII '89, Reinhardsbrunn Castle, GDR, October 1-6, 1989. Proceedings
• Learning recursive languages from good examples
• Rich classes inferable from positive data: Length-bounded elementary formal systems
• A theory of formal synthesis via inductive learning
• Learnability of automatic classes
• Even linear simple matrix languages: formal language properties and grammatical inference.
• Language learning from texts: Mindchanges, limited memory and monotonicity
• Queries and concept learning
• Probabilistic computability and choice
• Iterative learning from positive data and negative counterexamples
• Learning erasing pattern languages with queries
• Relations between Gold-style learning and query learning
• Automatic functions, linear time and learning
• Characteristics of Minimal Effective Programming Systems
• Automatic Learning from Positive Data and Negative Counterexamples
• Independence Results for n-Ary Recursion Theorems
• Difficulties in Forcing Fairness of Polynomial Time Inductive Inference
• Inductive inference of formal languages from positive data
• Learning via queries in [+, <]
• Toward a mathematical theory of inductive inference
• On the impact of forgetting on learning machines
• ON AUTOMATIC FAMILIES
• Towards General Algorithms for Grammatical Inference
• Language identification in the limit

This page was built for publication: Automatic learning from positive data and negative counterexamples