Learning languages in a union (Q859985): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 12:49, 25 June 2024

scientific article

Language	Label	Description	Also known as
English	Learning languages in a union	scientific article

Statements

scholarly article

0 references

Learning languages in a union (English)

0 references

zbMATH Open document ID

0 references

10.1016/j.jcss.2006.01.005

0 references

0 references

0 references

0 references

Journal of Computer and System Sciences

0 references

publication date

22 January 2007

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

zbMATH Keywords

unions of languages

0 references

inductive inference

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.jcss.2006.01.005

0 references

0 references

Inductive inference of formal languages from positive data

0 references

0 references

A Machine-Independent Theory of the Complexity of Recursive Functions

0 references

Toward a mathematical theory of inductive inference

0 references

0 references

On the intrinsic complexity of learning

0 references

Prudence and other conditions on formal language learning

0 references

On learning unions of pattern languages and tree patterns in the mistake bound model.

0 references

Language identification in the limit

0 references

The intrinsic complexity of language identification

0 references

The theory of well-quasi-ordering: a frequently discovered concept

0 references

0 references

Inductive inference of unbounded unions of pattern languages from positive data

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:859985

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q859985&oldid=34913061"