scientific article
From MaRDI portal
Publication:4013550
zbMath0747.68061MaRDI QIDQ4013550
Publication date: 27 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45)
Related Items
Learning elementary formal systems with queries. ⋮ Decision lists over regular patterns. ⋮ Polynomial-time identification of very simple grammars from positive data. ⋮ \(k\)-valued non-associative Lambek grammars are learnable from generalized functor-argument structures ⋮ Inductive inference and reverse mathematics ⋮ Closure properties of pattern languages ⋮ Learning languages in a union ⋮ From learning in the limit to stochastic finite learning ⋮ Learning of erasing primitive formal systems from positive examples ⋮ Learning a subclass of regular patterns in polynomial time ⋮ On approximately identifying concept classes in the limit ⋮ Identification of function distinguishable languages. ⋮ Languages as hyperplanes: grammatical inference with string kernels ⋮ Learning figures with the Hausdorff metric by fractals -- towards computable binary classification ⋮ Parallelism Increases Iterative Learning Power ⋮ Learning Bounded Unions of Noetherian Closed Set Systems Via Characteristic Sets ⋮ Learning Node Label Controlled Graph Grammars (Extended Abstract) ⋮ Topological Properties of Concept Spaces ⋮ Developments from enquiries into the learnability of the pattern languages from positive data ⋮ Discontinuities in pattern inference ⋮ Learning indexed families of recursive languages from positive data: A survey ⋮ Set systems: order types, continuous nondeterministic deformations, and quasi-orders ⋮ Towards a mathematical theory of machine discovery from facts ⋮ Learning concepts and their unions from positive data with refinement operators ⋮ On uniform learnability of language families ⋮ Topological properties of concept spaces (full version) ⋮ k-Valued Non-Associative Lambek Grammars are Learnable from Function-Argument Structures ⋮ Synthesizing learners tolerating computable noisy data ⋮ Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data ⋮ Mind change efficient learning ⋮ On families of categorial grammars of bounded value, their learnability and related complexity questions ⋮ Learning in the limit with lattice-structured hypothesis spaces ⋮ Inductive inference of unbounded unions of pattern languages from positive data ⋮ Existence and nonexistence of descriptive patterns ⋮ Commutative Regular Shuffle Closed Languages, Noetherian Property, and Learning Theory ⋮ Inductive inference of monotonic formal systems from positive data ⋮ Parallelism increases iterative learning power ⋮ Existence and Nonexistence of Descriptive Patterns ⋮ Ordinal mind change complexity of language identification ⋮ On learning unions of pattern languages and tree patterns in the mistake bound model. ⋮ The synthesis of language learners. ⋮ Incremental concept learning for bounded data mining. ⋮ On a generalized notion of mistake bounds ⋮ Mind change complexity of learning logic programs ⋮ A non-learnable class of E-pattern languages
