Monotonic and dual monotonic language learning

DOI10.1016/0304-3975(95)00284-7zbMATH Open0872.68146OpenAlexW2070494326MaRDI QIDQ672148FDOQ672148

Authors: S. Lange, Thomas Zeugmann, Shyam Kapur 

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00284-7

Recommendations

• Characterizations of monotonic and dual monotonic language learning
• Characterization of language learning front informant under various monotonicity constraints
• Learning and extending sublanguages
• scientific article; zbMATH DE number 408780
• Learning and Extending Sublanguages

zbMATH Keywords

algorithmic language learningdual monotonic language learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Inductive inference of formal languages from positive data
• Title not available (Why is that?)
• Toward a mathematical theory of inductive inference
• Title not available (Why is that?)
• Title not available (Why is that?)
• Language identification in the limit
• A formal theory of inductive inference. Part II
• Monotonic and non-monotonic inductive inference
• Prudence and other conditions on formal language learning
• Finding patterns common to a set of strings
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computational limitations on learning from examples
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Characterizations of monotonic and dual monotonic language learning
• Title not available (Why is that?)
• Title not available (Why is that?)
• Polynomial-time inference of arbitrary pattern languages
• Ignoring data may be the only way to learn efficiently
• LEARNING RECURSIVE LANGUAGES WITH BOUNDED MIND CHANGES
• Set-driven and rearrangement-independent learning of recursive languages
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Characterization of language learning front informant under various monotonicity constraints
• Inclusion is undecidable for pattern languages

Cited In (23)

• Set-driven and rearrangement-independent learning of recursive languages
• Title not available (Why is that?)
• Noisy inference and oracles
• Aspects of complexity of probabilistic learning under monotonicity constraints
• Hypothesis spaces for learning
• Learning indexed families of recursive languages from positive data: A survey
• Learning and Extending Sublanguages
• Prescribed learning of r.e. 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
• Title not available (Why is that?)
• Mapping monotonic restrictions in inductive inference
• Characterizations of monotonic and dual monotonic language learning
• Noisy inference and oracles
• Probabilistic language learning under monotonicity constraints
• Learning and extending sublanguages
• Generalized notions of mind change complexity
• Characterizing language identification in terms of computable numberings

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)