Monotonic and dual monotonic language learning
From MaRDI portal
Publication:672148
Recommendations
Cites work
- scientific article; zbMATH DE number 3427224 (Why is no real title available?)
- scientific article; zbMATH DE number 3860427 (Why is no real title available?)
- scientific article; zbMATH DE number 3932417 (Why is no real title available?)
- scientific article; zbMATH DE number 3954298 (Why is no real title available?)
- scientific article; zbMATH DE number 43947 (Why is no real title available?)
- scientific article; zbMATH DE number 44622 (Why is no real title available?)
- scientific article; zbMATH DE number 50933 (Why is no real title available?)
- scientific article; zbMATH DE number 3539202 (Why is no real title available?)
- scientific article; zbMATH DE number 3555228 (Why is no real title available?)
- scientific article; zbMATH DE number 3586480 (Why is no real title available?)
- scientific article; zbMATH DE number 3584924 (Why is no real title available?)
- scientific article; zbMATH DE number 408780 (Why is no real title available?)
- scientific article; zbMATH DE number 517031 (Why is no real title available?)
- scientific article; zbMATH DE number 517033 (Why is no real title available?)
- scientific article; zbMATH DE number 3806956 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- A formal theory of inductive inference. Part II
- Characterization of language learning front informant under various monotonicity constraints
- Characterizations of monotonic and dual monotonic language learning
- Computational limitations on learning from examples
- Finding patterns common to a set of strings
- Ignoring data may be the only way to learn efficiently
- Inclusion is undecidable for pattern languages
- Inductive inference of formal languages from positive data
- LEARNING RECURSIVE LANGUAGES WITH BOUNDED MIND CHANGES
- Language identification in the limit
- Monotonic and non-monotonic inductive inference
- Polynomial-time inference of arbitrary pattern languages
- Prudence and other conditions on formal language learning
- Set-driven and rearrangement-independent learning of recursive languages
- Toward a mathematical theory of inductive inference
Cited in
(23)- Aspects of complexity of probabilistic learning under monotonicity constraints
- On the data consumption benefits of accepting increased uncertainty
- Characterizations of monotonic and dual monotonic language learning
- Hypothesis spaces for learning
- Synthesizing noise-tolerant language learners
- Synthesizing learners tolerating computable noisy data
- Noisy inference and oracles
- Probabilistic language learning under monotonicity constraints
- Learning and Extending Sublanguages
- Prescribed learning of r.e. classes
- Generalized notions of mind change complexity
- Characterizing language identification in terms of computable numberings
- scientific article; zbMATH DE number 408780 (Why is no real title available?)
- A modal logic for supervised learning
- Learning and extending sublanguages
- Ordinal mind change complexity of language identification
- Prescribed Learning of R.E. Classes
- scientific article; zbMATH DE number 2077171 (Why is no real title available?)
- Learning indexed families of recursive languages from positive data: A survey
- Mapping monotonic restrictions in inductive inference
- Set-driven and rearrangement-independent learning of recursive languages
- Noisy inference and oracles
- Hypothesis Spaces for Learning
This page was built for publication: Monotonic and dual monotonic language learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672148)
