Unions of identifiable families of languages

Kalvis Apsītis; Rūsiņš Freivalds; Raimonds Simanovskis; Juris Smotrovs

doi:10.1007/BFb0033341

Unions of identifiable families of languages

Kalvis Apsītis
, Rūsiņš Freivalds
, Raimonds Simanovskis
, Juris Smotrovs

University of Maryland, College Park

Research output: Chapter in Book/Report/Conference proceeding › Conference paper › Research › peer-review

2 Citations (Scopus)

Abstract

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.

Original language	English
Title of host publication	Grammatical Inference
Subtitle of host publication	Learning Syntax from Sentences - 3rd International Colloquium, ICGI-1996, Proceedings
Editors	Colin de la Higuera, Laurent Miclet
Publisher	Springer Verlag
Pages	49-58
Number of pages	10
ISBN (Print)	3540617787, 9783540617785
DOIs	https://doi.org/10.1007/BFb0033341
Publication status	Published - 1996
Event	3rd International Colloquium on Grammatical Inference, ICGI 1996 - Montpellier, France Duration: 25 Sept 1996 → 27 Sept 1996

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1147
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	3rd International Colloquium on Grammatical Inference, ICGI 1996
Country/Territory	France
City	Montpellier
Period	25/09/96 → 27/09/96

Access to Document

10.1007/BFb0033341

Cite this

Apsītis, K., Freivalds, R., Simanovskis, R., & Smotrovs, J. (1996). Unions of identifiable families of languages. In C. de la Higuera, & L. Miclet (Eds.), Grammatical Inference: Learning Syntax from Sentences - 3rd International Colloquium, ICGI-1996, Proceedings (pp. 49-58). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1147). Springer Verlag. https://doi.org/10.1007/BFb0033341

Apsītis, Kalvis ; Freivalds, Rūsiņš ; Simanovskis, Raimonds et al. / Unions of identifiable families of languages. Grammatical Inference: Learning Syntax from Sentences - 3rd International Colloquium, ICGI-1996, Proceedings. editor / Colin de la Higuera ; Laurent Miclet. Springer Verlag, 1996. pp. 49-58 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{cda6395744294a588d6dd2e0100e389d,

title = "Unions of identifiable families of languages",

abstract = "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.",

author = "Kalvis Apsītis and Rūsiņ{\v s} Freivalds and Raimonds Simanovskis and Juris Smotrovs",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1996.; 3rd International Colloquium on Grammatical Inference, ICGI 1996 ; Conference date: 25-09-1996 Through 27-09-1996",

year = "1996",

doi = "10.1007/BFb0033341",

language = "English",

isbn = "3540617787",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "49--58",

editor = "\{de la Higuera\}, Colin and Laurent Miclet",

booktitle = "Grammatical Inference",

address = "Germany",

}

Apsītis, K, Freivalds, R, Simanovskis, R & Smotrovs, J 1996, Unions of identifiable families of languages. in C de la Higuera & L Miclet (eds), Grammatical Inference: Learning Syntax from Sentences - 3rd International Colloquium, ICGI-1996, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1147, Springer Verlag, pp. 49-58, 3rd International Colloquium on Grammatical Inference, ICGI 1996, Montpellier, France, 25/09/96. https://doi.org/10.1007/BFb0033341

Unions of identifiable families of languages. / Apsītis, Kalvis; Freivalds, Rūsiņš; Simanovskis, Raimonds et al.
Grammatical Inference: Learning Syntax from Sentences - 3rd International Colloquium, ICGI-1996, Proceedings. ed. / Colin de la Higuera; Laurent Miclet. Springer Verlag, 1996. p. 49-58 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1147).

Research output: Chapter in Book/Report/Conference proceeding › Conference paper › Research › peer-review

TY - GEN

T1 - Unions of identifiable families of languages

AU - Apsītis, Kalvis

AU - Freivalds, Rūsiņš

AU - Simanovskis, Raimonds

AU - Smotrovs, Juris

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1996.

PY - 1996

Y1 - 1996

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/84949198957

U2 - 10.1007/BFb0033341

DO - 10.1007/BFb0033341

M3 - Conference paper

AN - SCOPUS:84949198957

SN - 3540617787

SN - 9783540617785

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 49

EP - 58

BT - Grammatical Inference

A2 - de la Higuera, Colin

A2 - Miclet, Laurent

PB - Springer Verlag

T2 - 3rd International Colloquium on Grammatical Inference, ICGI 1996

Y2 - 25 September 1996 through 27 September 1996

ER -

Apsītis K, Freivalds R, Simanovskis R, Smotrovs J. Unions of identifiable families of languages. In de la Higuera C, Miclet L, editors, Grammatical Inference: Learning Syntax from Sentences - 3rd International Colloquium, ICGI-1996, Proceedings. Springer Verlag. 1996. p. 49-58. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/BFb0033341

Unions of identifiable families of languages

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this