Locality, reversibility, and beyond: Learning languages from positive data

Tom Head, Satoshi Kobayashi, Takashi Yokomori

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    8 Citations (Scopus)

    Abstract

    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.

    Original languageEnglish
    Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    PublisherSpringer Verlag
    Pages191-204
    Number of pages14
    Volume1501
    ISBN (Print)354065013X, 9783540650133
    Publication statusPublished - 1998
    Event9th International Conference on Algorithmic Learning Theory, ALT 1998 - Otzenhausen, Germany
    Duration: 1998 Oct 81998 Oct 10

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume1501
    ISSN (Print)03029743
    ISSN (Electronic)16113349

    Other

    Other9th International Conference on Algorithmic Learning Theory, ALT 1998
    CountryGermany
    CityOtzenhausen
    Period98/10/898/10/10

      Fingerprint

    Keywords

    • Approximate learning
    • Identification in the limit from positive data
    • Local languages
    • Regular languages
    • Reversible languages

    ASJC Scopus subject areas

    • Computer Science(all)
    • Theoretical Computer Science

    Cite this

    Head, T., Kobayashi, S., & Yokomori, T. (1998). Locality, reversibility, and beyond: Learning languages from positive data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1501, pp. 191-204). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1501). Springer Verlag.