Learning approximately regular languages with reversible languages

Satoshi Kobayashi, Takashi Yokomori

Research output: Contribution to journalArticle

27 Citations (Scopus)


In this note, we consider the problem of learning approximately regular languages in the limit from positive data using the class of k-reversible languages. The class of k-reversible languages was introduced by Angluin (1982), and proved to be efficiently identifiable in the limit from positive data only. We show that Angluin's learning algorithm for the class of k-reversible languages can be readily adopted for the approximate identification of regular languages from positive data. Considering the negative result on the exact identifiability by Gold (1967), this approximation approach would be one of the best we could hope for learning the class of regular languages from positive data only.

Original languageEnglish
Pages (from-to)251-257
Number of pages7
JournalTheoretical Computer Science
Issue number1-2
Publication statusPublished - 1997 Mar 15



  • Approximate learning
  • Computational learning theory
  • Formal language theory
  • Identification in the limit

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this