Learning languages in a union
type: Item
instance of: scholarly article
title: Learning languages in a union
zbMATH Open document ID: 1178.68317
author: Sanjay Jain
author: Yen Kaow Ng
author: Tiong Seng Tay
published in: Journal of Computer and System Sciences
publication date: 2007-01-22T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5117740
zbMATH Keywords: unions of languages
zbMATH Keywords: inductive inference
MaRDI profile type: Publication
full work available at URL: j.jcss.2006.01.005
OpenAlex ID: W2158095302
cites work: Inductive inference of formal languages from positive data
cites work: Q4942639
cites work: A Machine-Independent Theory of the Complexity of Recursive Functions
cites work: Toward a mathematical theory of inductive inference
cites work: Q5729657
cites work: On the intrinsic complexity of learning
cites work: Prudence and other conditions on formal language learning
cites work: On learning unions of pattern languages and tree patterns in the mistake bound model.
cites work: Language identification in the limit
cites work: The intrinsic complexity of language identification
cites work: The theory of well-quasi-ordering: a frequently discovered concept
cites work: Q5573961
cites work: Inductive inference of unbounded unions of pattern languages from positive data
cites work: Q4013550
DOI: 10.1016/J.JCSS.2006.01.005
Recommended article: Q4473557
Recommended article: Learning multiple languages in groups
Recommended article: Algorithmic Learning Theory
Recommended article: Q4038689
Recommended article: Learning language intersections
Recommended article: Q4440395
Recommended article: Optimal Language Learning
Recommended article: Language learning without overgeneralization
description: scientific article; zbMATH DE number 5117740