Skip to main content
SpringerLink
Log in

Unions of identifiable families of languages

  • Session: Algebraic Methods and Algorithms 1
  • Conference paper
  • First Online:
Grammatical Interference: Learning Syntax from Sentences (ICGI 1996)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1147))

Included in the following conference series:

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.

The research of the last three authors was supported by Latvian Science Council Grant No. 93.599. The research of the last two authors was supported by the “SWH izglītībai, zinātnei un kultūrai” scholarship.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. Apsītis, R. Freivalds, M. Kriķis, R. Simanovskis, J. Smotrovs. Unions of identifiable classes of total recursive functions. Lecture Notes in Artificial Intelligence, vol. 642, pp. 99–107. Springer-Verlag, 1992.

    Google Scholar 

  2. J. Case and C. Lynes. Machine inductive inference and language identification. Lecture Notes in Computer Science, vol. 140, pp. 107–115, Springer-Verlag, 1982.

    Google Scholar 

  3. E. M. Gold. Language identification in the limit. Information and Control, vol. 10, pp. 447–474, 1967.

    Article  Google Scholar 

  4. S. Jain and A. Sharma. On identification by teams and probabilistic machines. Lecture Notes in Artificial Intelligence, vol. 961, pp. 108–145, Springer-Verlag, 1995.

    Google Scholar 

  5. D. N. Osherson, M. Stob, S. Weinstein. Systems That Learn. The MIT Press, 1986.

    Google Scholar 

  6. D. Osherson and S. Weinstein. Criteria of language learning. Information and Control, vol. 52, pp. 123–138, 1982.

    Article  Google Scholar 

  7. H. Rogers, Jr. Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York, 1967.

    Google Scholar 

  8. J. Smotrovs, EX-identification of unions. In preparation, 1996.

    Google Scholar 

  9. R. Smullyan. Theory of Formal Systems. Annals of Mathematical Studies, vol. 47, Princeton, 1961.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Maryland, 20742, College Park, MD, USA

    Kalvis Apsītis

  2. Institute of Mathematics and Computer Science, University of Latvia, Raiņa bulv. 29, LV-1459, Rīga, Latvia

    Rūsiņš Freivalds, Raimonds Simanovskis & Juris Smotrovs

Authors
  1. Kalvis Apsītis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rūsiņš Freivalds
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Raimonds Simanovskis
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Juris Smotrovs
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Laurent Miclet Colin de la Higuera

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Apsītis, K., Freivalds, R., Simanovskis, R., Smotrovs, J. (1996). Unions of identifiable families of languages. In: Miclet, L., de la Higuera, C. (eds) Grammatical Interference: Learning Syntax from Sentences. ICGI 1996. Lecture Notes in Computer Science, vol 1147. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0033341

Download citation

  • DOI: https://doi.org/10.1007/BFb0033341

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61778-5

  • Online ISBN: 978-3-540-70678-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation