Learning languages in a union
From MaRDI portal
Publication:859985
DOI10.1016/J.JCSS.2006.01.005zbMATH Open1178.68317OpenAlexW2158095302MaRDI QIDQ859985FDOQ859985
Authors: Sanjay Jain, Yen Kaow Ng, Tiong Seng Tay 
Publication date: 22 January 2007
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2006.01.005
Recommendations
- scientific article; zbMATH DE number 2080661
- Learning multiple languages in groups
- Algorithmic Learning Theory
- scientific article; zbMATH DE number 177811
- Learning language intersections
- scientific article; zbMATH DE number 2019602
- Optimal Language Learning
- Language learning without overgeneralization
Cites Work
- Inductive inference of formal languages from positive data
- Toward a mathematical theory of inductive inference
- Title not available (Why is that?)
- Language identification in the limit
- Prudence and other conditions on formal language learning
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Title not available (Why is that?)
- The intrinsic complexity of language identification
- On the intrinsic complexity of learning
- The theory of well-quasi-ordering: a frequently discovered concept
- Title not available (Why is that?)
- Inductive inference of unbounded unions of pattern languages from positive data
- Title not available (Why is that?)
- On learning unions of pattern languages and tree patterns in the mistake bound model.
Cited In (7)
This page was built for publication: Learning languages in a union
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q859985)
