Polynomial-time inference of arbitrary pattern languages
From MaRDI portal
Publication:749229
DOI10.1007/BF03037093zbMATH Open0712.68082MaRDI QIDQ749229FDOQ749229
Authors: S. Lange, Rolf Wiehagen 
Publication date: 1991
Published in: New Generation Computing (Search for Journal in Brave)
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Analysis of algorithms and problem complexity (68Q25) Probability and inductive logic (03B48)
Cites Work
Cited In (56)
- Co-learning of recursive languages from positive data
- An average-case optimal one-variable pattern language learner
- Set-driven and rearrangement-independent learning of recursive languages
- Parallelism Increases Iterative Learning Power
- Automatic learning of subclasses of pattern languages
- Learning a subclass of regular patterns in polynomial time
- Learning erasing pattern languages with queries
- Inferring descriptive generalisations of formal languages
- Variations on U-shaped learning
- Learning indexed families of recursive languages from positive data: A survey
- U-shaped, iterative, and iterative-with-counter learning
- Monotonic and dual monotonic language learning
- Iterative learning of simple external contextual languages
- Learning efficiency of very simple grammars from positive data
- Learning in the limit with lattice-structured hypothesis spaces
- Learning pattern languages over groups
- Polynomial-time algorithms for learning typed pattern languages
- Developments from enquiries into the learnability of the pattern languages from positive data
- Gold-style learning theory. A selection of highlights since Gold
- Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries
- Polynomial Time Algorithms for Learning k-Reversible Languages and Pattern Languages with Correction Queries
- On Learning Regular Expressions and Patterns Via Membership and Correction Queries
- UNAMBIGUOUS MORPHIC IMAGES OF STRINGS
- Patterns with bounded treewidth
- A model of interactive teaching
- On the power of incremental learning.
- From learning in the limit to stochastic finite learning
- A non-learnable class of E-pattern languages
- Discontinuities in pattern inference
- Revisiting Shinohara's algorithm for computing descriptive patterns
- On the power of inductive inference from good examples
- On learning unions of pattern languages and tree patterns in the mistake bound model.
- Ignoring data may be the only way to learn efficiently
- Polynomial inference of universal automata from membership and equivalence queries
- Learning pattern languages over groups
- Logic program synthesis from incomplete specifications
- Closure properties of pattern languages
- Regular and context-free pattern languages over small alphabets
- Characterization of language learning front informant under various monotonicity constraints
- Inductive inference of approximations for recursive concepts
- Learning relational patterns
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parallelism increases iterative learning power
- Title not available (Why is that?)
- Identification of pattern languages from examples and queries
- Learnability of automatic classes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Regular patterns, regular languages and context-free languages
- Title not available (Why is that?)
- Learning Efficiency of Very Simple Grammars from Positive Data
- Iterative Learning of Simple External Contextual Languages
- Incremental concept learning for bounded data mining.
- Case-based representation and learning of pattern languages
This page was built for publication: Polynomial-time inference of arbitrary pattern languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q749229)
