Learning languages from positive data and a finite number of queries
From MaRDI portal
Publication:2490120
DOI10.1016/j.ic.2005.09.001zbMath1093.68047MaRDI QIDQ2490120
Publication date: 28 April 2006
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2005.09.001
Related Items
Iterative learning from positive data and negative counterexamples, Learning languages from positive data and a limited number of short counterexamples, Learning from Positive Data and Negative Counterexamples: A Survey
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Comparison of identification criteria for machine inductive inference
- Prudence and other conditions on formal language learning
- Learning regular sets from queries and counterexamples
- Finding patterns common to a set of strings
- Extremes in the degrees of inferability
- Learning elementary formal systems with queries.
- Language learning with some negative information
- Queries and concept learning
- The Power of Pluralism for Automatic Program Synthesis
- Learning read-once formulas with queries
- Periodicity in generations of automata
- Toward a mathematical theory of inductive inference
- Learning via queries
- Learning Theory
- Criteria of language learning
- Algorithmic Learning Theory
- Algorithmic Learning Theory
- Language identification in the limit
