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
DOI
出版ステータスPublished - 1997 3 15
外部発表はい

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「Learning approximately regular languages with reversible languages」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル