Unions of identifiable families of languages

Autor:	Raimonds Simanovskis, Kalvis Apsitis, Rusins Freivalds, Juris Smotrovs
Rok vydání:	1996
Předmět:	Set (abstract data type) Discrete mathematics Identification (information) Limit (category theory) Identifiability Language family Inductive reasoning Boolean satisfiability problem Mathematical economics Satisfiability Mathematics
Zdroj:	Grammatical Interference: Learning Syntax from Sentences ISBN: 9783540617785 ICGI
DOI:	10.1007/bfb0033341
Popis:	This paper deals with the satisfiability of requirements put on the identifiability of unions of language families. We consider identification in the limit from a text with bounds on mindchanges and anomalies. We show that, though these identification types are not closed under the set union, some of them still have features that resemble closedness. To formalize this, we generalize the notion of closedness. Then by establishing “how closed” these identification types are we solve the satisfiability problem.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::09dd9950afc79986cf8813eef00b0c04 https://doi.org/10.1007/bfb0033341 Zobrazit plný text záznamu