scientific article; zbMATH DE number 67629
From MaRDI portal
Publication:4013550
zbMATH Open0747.68061MaRDI QIDQ4013550FDOQ4013550
Authors: Keith Wright 
Publication date: 27 September 1992
Title of this publication is not available (Why is that?)
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45)
Cited In (49)
- On a generalized notion of mistake bounds
- Parallelism Increases Iterative Learning Power
- Learning a subclass of regular patterns in polynomial time
- Title not available (Why is that?)
- Identifying terminal distinguishable languages
- Decision lists over regular patterns.
- The synthesis of language learners.
- Languages as hyperplanes: grammatical inference with string kernels
- Title not available (Why is that?)
- Learning indexed families of recursive languages from positive data: A survey
- On families of categorial grammars of bounded value, their learnability and related complexity questions
- Learning in the limit with lattice-structured hypothesis spaces
- On approximately identifying concept classes in the limit
- Developments from enquiries into the learnability of the pattern languages from positive data
- Existence and nonexistence of descriptive patterns
- Learning of erasing primitive formal systems from positive examples
- Mind change efficient learning
- On uniform learnability of language families
- From learning in the limit to stochastic finite learning
- \(k\)-valued non-associative Lambek grammars are learnable from generalized functor-argument structures
- Commutative Regular Shuffle Closed Languages, Noetherian Property, and Learning Theory
- A non-learnable class of E-pattern languages
- Discontinuities in pattern inference
- \(K\)-valued non-associative Lambek grammars are learnable from function-argument structures
- Polynomial-time identification of very simple grammars from positive data.
- Inductive inference of monotonic formal systems from positive data
- Inductive inference and reverse mathematics
- On learning unions of pattern languages and tree patterns in the mistake bound model.
- Learning Bounded Unions of Noetherian Closed Set Systems Via Characteristic Sets
- Ordinal mind change complexity of language identification
- Learning Node Label Controlled Graph Grammars (Extended Abstract)
- Closure properties of pattern languages
- Topological properties of concept spaces (full version)
- Synthesizing learners tolerating computable noisy data
- Learning figures with the Hausdorff metric by fractals -- towards computable binary classification
- Inductive inference of unbounded unions of pattern languages from positive data
- Existence and Nonexistence of Descriptive Patterns
- Parallelism increases iterative learning power
- Set systems: order types, continuous nondeterministic deformations, and quasi-orders
- Mind change complexity of learning logic programs
- Learning elementary formal systems with queries.
- Topological Properties of Concept Spaces
- Learning concepts and their unions from positive data with refinement operators
- Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data
- Learning languages in a union
- Incremental concept learning for bounded data mining.
- Towards a mathematical theory of machine discovery from facts
- Characterizing language identification in terms of computable numberings
- Identification of function distinguishable languages.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4013550)
