Learning and extending sublanguages
From MaRDI portal
Publication:924178
DOI10.1016/j.tcs.2008.02.031zbMath1145.68024OpenAlexW2173996255MaRDI QIDQ924178
Publication date: 28 May 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.02.031
Related Items (1)
Cites Work
- Comparison of identification criteria for machine inductive inference
- Learning all subfunctions of a function
- Monotonic and non-monotonic inductive inference
- Finding patterns common to a set of strings
- Learning approximately regular languages with reversible languages
- Generalization and specialization strategies for learning r. e. languages
- Learning in the presence of inaccurate information
- Noisy inference and oracles
- Gödel numberings of partial recursive functions
- Learning and Extending Sublanguages
- Inductive inference of formal languages from positive data
- Toward a mathematical theory of inductive inference
- On the impact of forgetting on learning machines
- Criteria of language learning
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Language identification in the limit
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Learning and extending sublanguages