Monotonic and dual monotonic language learning
From MaRDI portal
(Redirected from 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
(33)- Set-driven and rearrangement-independent learning of recursive languages
- scientific article; zbMATH DE number 408780 (Why is no real title available?)
- Noisy inference and oracles
- Ideal presentations and numberings of some classes of effective quasi-Polish spaces
- On the Weihrauch degree of the additive Ramsey theorem
- On the first-order parts of problems in the Weihrauch degrees
- Hypothesis spaces for learning
- Learning indexed families of recursive languages from positive data: A survey
- Aspects of complexity of probabilistic learning under monotonicity constraints
- Prescribed learning of r.e. classes
- Learning and Extending Sublanguages
- Hilbert's tenth problem for term algebras with a substitution operator
- Defining long words succinctly in FO and MSO
- Complemented subsets and Boolean-valued, partial functions
- Algorithmically random series
- Lower bounds on () and other properties of -register machines
- Reifying dynamical algebra: maximal ideals in countable rings, constructively
- Maps for learning indexable classes
- Prescribed Learning of R.E. Classes
- A modal logic for supervised learning
- On the data consumption benefits of accepting increased uncertainty
- Ordinal mind change complexity of language identification
- Synthesizing noise-tolerant language learners
- Synthesizing learners tolerating computable noisy data
- Hypothesis Spaces for Learning
- Mapping monotonic restrictions in inductive inference
- scientific article; zbMATH DE number 2077171 (Why is no real title available?)
- Characterizations of monotonic and dual monotonic language learning
- Noisy inference and oracles
- Probabilistic language learning under monotonicity constraints
- Learning and extending sublanguages
- Characterizing language identification in terms of computable numberings
- Generalized notions of mind change complexity
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)
