Learning approximately regular languages
โ
Satoshi Kobayashi; Takashi Yokomori
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 490 KB
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