Learning languages in a union
From MaRDI portal
Publication:859985
DOI10.1016/j.jcss.2006.01.005zbMath1178.68317OpenAlexW2158095302MaRDI QIDQ859985
Tiong Seng Tay, Yen Kaow Ng, Sanjay Jain
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
Related Items (2)
Learning multiple languages in groups ⋮ Learning concepts and their unions from positive data with refinement operators
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Prudence and other conditions on formal language learning
- On learning unions of pattern languages and tree patterns in the mistake bound model.
- The intrinsic complexity of language identification
- On the intrinsic complexity of learning
- The theory of well-quasi-ordering: a frequently discovered concept
- Inductive inference of formal languages from positive data
- Toward a mathematical theory of inductive inference
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Language identification in the limit
- Inductive inference of unbounded unions of pattern languages from positive data
This page was built for publication: Learning languages in a union