Polynomial-time inference of arbitrary pattern languages
From MaRDI portal
Recommendations
Cites work
Cited in
(56)- An average-case optimal one-variable pattern language learner
- Automatic learning of subclasses of pattern languages
- Parallelism Increases Iterative Learning Power
- Set-driven and rearrangement-independent learning of recursive languages
- Learning a subclass of regular patterns in polynomial time
- Learning erasing pattern languages with queries
- Inferring descriptive generalisations of formal languages
- Co-learning of recursive languages from positive data
- 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
- Developments from enquiries into the learnability of the pattern languages from positive data
- Polynomial-time algorithms for learning typed pattern languages
- 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
- Patterns with bounded treewidth
- A model of interactive teaching
- UNAMBIGUOUS MORPHIC IMAGES OF STRINGS
- From learning in the limit to stochastic finite learning
- On the power of incremental 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.
- Polynomial inference of universal automata from membership and equivalence queries
- Ignoring data may be the only way to learn efficiently
- 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
- Inductive inference of approximations for recursive concepts
- Characterization of language learning front informant under various monotonicity constraints
- Learning relational patterns
- Parallelism increases iterative learning power
- scientific article; zbMATH DE number 67610 (Why is no real title available?)
- scientific article; zbMATH DE number 408772 (Why is no real title available?)
- Identification of pattern languages from examples and queries
- scientific article; zbMATH DE number 2149593 (Why is no real title available?)
- Learnability of automatic classes
- scientific article; zbMATH DE number 1966625 (Why is no real title available?)
- scientific article; zbMATH DE number 3868655 (Why is no real title available?)
- scientific article; zbMATH DE number 517032 (Why is no real title available?)
- Regular patterns, regular languages and context-free languages
- scientific article; zbMATH DE number 7278096 (Why is no real title available?)
- Case-based representation and learning of pattern languages
- Incremental concept learning for bounded data mining.
- Learning Efficiency of Very Simple Grammars from Positive Data
- Iterative Learning of Simple External Contextual 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)
