Skip to main content
Conference Proceedings

Learning automatic families of languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2016) 9587 29-40
DOI: 10.1007/978-3-662-49192-8_3
1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A class of languages is automatic if it is uniformly regular using some regular index set for the languages. In this survey we report on work about the learnability in the limit of automatic classes of languages, with some special emphasis to automatic learners.

Cite

CITATION STYLE

APA

Jain, S., & Stephan, F. (2016). Learning automatic families of languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9587, pp. 29–40). Springer Verlag. https://doi.org/10.1007/978-3-662-49192-8_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free