Pages that link to "Item:Q5674988"
From MaRDI portal
The following pages link to Language identification in the limit (Q5674988):
Displayed 50 items.
- Comparison of identification criteria for machine inductive inference (Q585192) (← links)
- Learning all subfunctions of a function (Q596299) (← links)
- Classes with easily learnable subclasses (Q598186) (← links)
- On the classification of recursive languages (Q598240) (← links)
- Anomalous learning helps succinctness (Q671420) (← links)
- Monotonic and dual monotonic language learning (Q672148) (← links)
- A learning-theoretic characterization of classes of recursive functions (Q673668) (← links)
- Language learning without overgeneralization (Q673781) (← links)
- Training digraphs (Q674181) (← links)
- On a question about learning nearly minimal programs (Q674285) (← links)
- Case-based representation and learning of pattern languages (Q674401) (← links)
- Towards a mathematical theory of machine discovery from facts (Q674404) (← links)
- Characterizing language identification in terms of computable numberings (Q676311) (← links)
- Solving divergence in Knuth--Bendix completion by enriching signatures (Q685379) (← links)
- On the non-existence of maximal inference degrees for language identification (Q685478) (← links)
- Resource restricted computability theoretic learning: Illustrative topics and problems (Q733738) (← links)
- Input-dependence in function-learning (Q733744) (← links)
- Inductive inference of monotonic formal systems from positive data (Q749217) (← links)
- Polynomial-time inference of arbitrary pattern languages (Q749229) (← links)
- Inference of deterministic one-counter languages (Q794442) (← links)
- Note on a central lemma for learning theory (Q794446) (← links)
- On the inference of approximate programs (Q803121) (← links)
- Training sequences (Q811136) (← links)
- Learning via finitely many queries (Q812396) (← links)
- ``Linear'' chaos via paradoxical set decompositions. (Q815555) (← links)
- A non-learnable class of E-pattern languages (Q817836) (← links)
- Unifying logic, topology and learning in parametric logic (Q817837) (← links)
- The complexity of finding SUBSEQ\((A)\) (Q839630) (← links)
- Learning languages in a union (Q859985) (← links)
- On the learnability of vector spaces (Q859986) (← links)
- An approach to intrinsic complexity of uniform learning (Q860823) (← links)
- On ordinal VC-dimension and some notions of complexity (Q860824) (← 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)
- Prudence and other conditions on formal language learning (Q912648) (← links)
- Learning recursive functions: A survey (Q924164) (← links)
- Reflective inductive inference of recursive functions (Q924166) (← links)
- Quantum inductive inference by finite automata (Q924168) (← links)
- Measuring teachability using variants of the teaching dimension (Q924171) (← links)
- Some classes of term rewriting systems inferable from positive data (Q924174) (← 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)
- Learning and extending sublanguages (Q924178) (← links)
- When unlearning helps (Q924730) (← links)
- Non-U-shaped vacillatory and team learning (Q927864) (← links)
- Learning languages from positive data and negative counterexamples (Q927865) (← links)
- Probabilistic and team PFIN-type learning: General properties (Q927866) (← links)
- Inferring answers to queries (Q927868) (← links)
