Characterization of Finite Identification

@inproceedings{Mukouchi1992CharacterizationOF,
  title={Characterization of Finite Identification},
  author={Yasuhito Mukouchi},
  booktitle={AII},
  year={1992}
}
  • Yasuhito Mukouchi
  • Published in AII 1992
  • Mathematics, Computer Science
  • A majority of studies on inductive inference of formal languages and models of logic programming have mainly used Gold's identification in the limit as a correct inference criterion. In this criterion, we can not decide in general whether the inference terminates or not, and the results of the inference necessarily involve some risks. In this paper, we deal with finite identification for a class of recursive languages. The inference machine produces a unique guess just once when it is convinced… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 28 CITATIONS

    Learning Automatic Families of Languages

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Finite Identification with Positive and with Complete Data

    VIEW 6 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    Algorithmic Learning Theory

    VIEW 5 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    On the Right Path: A Modal Logic for Supervised Learning

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Learning to act: qualitative learning of deterministic action models

    VIEW 2 EXCERPTS
    CITES METHODS & BACKGROUND

    Knowing one's limits: logical analysis of inductive inference

    VIEW 8 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    Learning Actions Models: Qualitative Approach

    VIEW 1 EXCERPT
    CITES BACKGROUND