The following pages link to (Q4013550):
Displaying 44 items.
- Inductive inference and reverse mathematics (Q324252) (← links)
- Closure properties of pattern languages (Q340552) (← links)
- Languages as hyperplanes: grammatical inference with string kernels (Q413838) (← links)
- Learning concepts and their unions from positive data with refinement operators (Q513348) (← links)
- Set systems: order types, continuous nondeterministic deformations, and quasi-orders (Q653312) (← links)
- Towards a mathematical theory of machine discovery from facts (Q674404) (← links)
- On families of categorial grammars of bounded value, their learnability and related complexity questions (Q714784) (← links)
- Learning in the limit with lattice-structured hypothesis spaces (Q714848) (← links)
- Inductive inference of monotonic formal systems from positive data (Q749217) (← links)
- A non-learnable class of E-pattern languages (Q817836) (← links)
- Learning languages in a union (Q859985) (← links)
- From learning in the limit to stochastic finite learning (Q860825) (← links)
- Learning of erasing primitive formal systems from positive examples (Q860828) (← links)
- Learning a subclass of regular patterns in polynomial time (Q860829) (← links)
- Developments from enquiries into the learnability of the pattern languages from positive data (Q924175) (← links)
- Discontinuities in pattern inference (Q924176) (← links)
- Learning indexed families of recursive languages from positive data: A survey (Q924177) (← links)
- Topological properties of concept spaces (full version) (Q963060) (← links)
- Existence and nonexistence of descriptive patterns (Q986561) (← links)
- Parallelism increases iterative learning power (Q1017664) (← links)
- On uniform learnability of language families (Q1195860) (← links)
- Identification of function distinguishable languages. (Q1401186) (← links)
- Ordinal mind change complexity of language identification (Q1575840) (← links)
- Mind change complexity of learning logic programs (Q1603595) (← links)
- On learning unions of pattern languages and tree patterns in the mistake bound model. (Q1853515) (← links)
- The synthesis of language learners. (Q1854290) (← links)
- Incremental concept learning for bounded data mining. (Q1854293) (← links)
- On a generalized notion of mistake bounds (Q1854426) (← links)
- Learning elementary formal systems with queries. (Q1874227) (← links)
- Decision lists over regular patterns. (Q1874229) (← links)
- Polynomial-time identification of very simple grammars from positive data. (Q1874233) (← links)
- Learning figures with the Hausdorff metric by fractals -- towards computable binary classification (Q1945017) (← links)
- Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data (Q2268856) (← links)
- \(k\)-valued non-associative Lambek grammars are learnable from generalized functor-argument structures (Q2369010) (← links)
- Mind change efficient learning (Q2496299) (← links)
- Parallelism Increases Iterative Learning Power (Q3520049) (← links)
- Learning Bounded Unions of Noetherian Closed Set Systems Via Characteristic Sets (Q3528411) (← links)
- Learning Node Label Controlled Graph Grammars (Extended Abstract) (Q3528431) (← links)
- Topological Properties of Concept Spaces (Q3529935) (← links)
- Commutative Regular Shuffle Closed Languages, Noetherian Property, and Learning Theory (Q3618571) (← links)
- Existence and Nonexistence of Descriptive Patterns (Q3637228) (← links)
- k-Valued Non-Associative Lambek Grammars are Learnable from Function-Argument Structures (Q4924528) (← links)
- Inductive inference of unbounded unions of pattern languages from positive data (Q5915396) (← links)
- Synthesizing learners tolerating computable noisy data (Q5943099) (← links)
