Locality, Reversibility, and Beyond: Learning Languages from Positive Data
In algorithmic learning theory fundamental roles are played by the family of languages that are locally testable in the strict sense and by the family of reversible languages. These two families are shown to be the first two members of an infinite sequence of families of regular languages the members of which are learnable in the limit from positive data only. A uniform procedure is given for deciding, for each regular language R and each of our specified families, whether R belongs to the family. The approximation of arbitrary regular languages by languages belonging to these families is discussed. Further, we will give a uniform scheme for learning these families from positive data. Several research problems are also suggested.
Keywordsreversible languages local languages regular languages identification in the limit from positive data approximate learning
Unable to display preview. Download preview PDF.
- 6.T. Head, Splicing representations of strictly locally testable languages, submitted for publication. (1997)Google Scholar
- 7.T. Head, Splicing languages generated with one-sided context, submitted for publication. (1997)Google Scholar
- 13.T. Yokomori, N. Ishida, and S. Kobayashi, Learning local languages and its application to protein alpha-chain identification, In Proc. of 27th Hawaii Intern. Conf. on System Sciences, IEEE Press, 113–122 (1994).Google Scholar
- 15.T. Yokomori and S. Kobayashi, Learning local languages and its application to DNA sequence analysis, IEEE Transactions on Pattern Analysis and Machine Intelligence, to appear.Google Scholar