Learning approximately regular languages with reversible languages

Satoshi Kobayashi, Takashi Yokomori

研究成果: Article

27 引用 (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.

元の言語English
ページ(範囲)251-257
ページ数7
ジャーナルTheoretical Computer Science
174
発行部数1-2
出版物ステータスPublished - 1997 3 15
外部発表Yes

    フィンガープリント

ASJC Scopus subject areas

  • Computational Theory and Mathematics

これを引用