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

    Formal languages
    Reversibility
    Locality
    Regular Languages
    Learning Theory
    Language Acquisition
    Family
    Arbitrary
    Approximation

    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.

    Locality, reversibility, and beyond : Learning languages from positive data. / Head, Tom; Kobayashi, Satoshi; Yokomori, Takashi.

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1501 Springer Verlag, 1998. p. 191-204 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1501).

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

    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, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1501, Springer Verlag, pp. 191-204, 9th International Conference on Algorithmic Learning Theory, ALT 1998, Otzenhausen, Germany, 98/10/8.
    Head T, Kobayashi S, Yokomori T. 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. Springer Verlag. 1998. p. 191-204. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    Head, Tom ; Kobayashi, Satoshi ; Yokomori, Takashi. / Locality, reversibility, and beyond : Learning languages from positive data. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1501 Springer Verlag, 1998. pp. 191-204 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{3406adcbd4fa4ed98c404e6d77410325,
    title = "Locality, reversibility, and beyond: Learning languages from positive data",
    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.",
    keywords = "Approximate learning, Identification in the limit from positive data, Local languages, Regular languages, Reversible languages",
    author = "Tom Head and Satoshi Kobayashi and Takashi Yokomori",
    year = "1998",
    language = "English",
    isbn = "354065013X",
    volume = "1501",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    publisher = "Springer Verlag",
    pages = "191--204",
    booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

    }

    TY - GEN

    T1 - Locality, reversibility, and beyond

    T2 - Learning languages from positive data

    AU - Head, Tom

    AU - Kobayashi, Satoshi

    AU - Yokomori, Takashi

    PY - 1998

    Y1 - 1998

    N2 - 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.

    AB - 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.

    KW - Approximate learning

    KW - Identification in the limit from positive data

    KW - Local languages

    KW - Regular languages

    KW - Reversible languages

    UR - http://www.scopus.com/inward/record.url?scp=84866131492&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84866131492&partnerID=8YFLogxK

    M3 - Conference contribution

    AN - SCOPUS:84866131492

    SN - 354065013X

    SN - 9783540650133

    VL - 1501

    T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    SP - 191

    EP - 204

    BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    PB - Springer Verlag

    ER -