### 抄録

In this paper, we study two operations of taking subspaces and homomorphic images of identifiable concept classes from positive data. We give sufficient conditions for the identifiable classes to be identifiable from positive data after the applications of those two operations. As one of the examples to show the effectiveness of the obtained theorems, we will apply them to the class of zero-reversible languages, and obtain some interesting identifiable language classes related to reversible languages. Further, we will show a connection of those theories to the theory of approximate identification in the limit from positive data([Kob96]). Another important contribution of this paper is am algebraic extension of Angluin's theorem in [Ang80] based on am algebraic characterization of zero-reversible languages given by [Pin87]. This generalized theorem tells us the importaace of Pin's chazacterization of zero-reversible languages using finitely generated groups in the context of identification in the limit from positive data.

元の言語 | English |
---|---|

ホスト出版物のタイトル | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |

出版者 | Springer Verlag |

ページ | 48-61 |

ページ数 | 14 |

巻 | 1316 |

ISBN（印刷物） | 3540635777, 9783540635772 |

DOI | |

出版物ステータス | Published - 1997 |

外部発表 | Yes |

イベント | 8th International Workshop on Algorithmic Learning Theory, ALT 1997 - Sendai, Japan 継続期間: 1997 10 6 → 1997 10 8 |

### 出版物シリーズ

名前 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

巻 | 1316 |

ISSN（印刷物） | 03029743 |

ISSN（電子版） | 16113349 |

### Other

Other | 8th International Workshop on Algorithmic Learning Theory, ALT 1997 |
---|---|

国 | Japan |

市 | Sendai |

期間 | 97/10/6 → 97/10/8 |

### Fingerprint

### ASJC Scopus subject areas

- Computer Science(all)
- Theoretical Computer Science

### これを引用

*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)*(巻 1316, pp. 48-61). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 1316). Springer Verlag. https://doi.org/10.1007/3-540-63577-7_35

**Identiflability of subspaces and homomorphic images of zero-reversible languages.** / Kobayashi, Satoshi; Yokomori, Takashi.

研究成果: Conference contribution

*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).*巻. 1316, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 巻. 1316, Springer Verlag, pp. 48-61, 8th International Workshop on Algorithmic Learning Theory, ALT 1997, Sendai, Japan, 97/10/6. https://doi.org/10.1007/3-540-63577-7_35

}

TY - GEN

T1 - Identiflability of subspaces and homomorphic images of zero-reversible languages

AU - Kobayashi, Satoshi

AU - Yokomori, Takashi

PY - 1997

Y1 - 1997

N2 - In this paper, we study two operations of taking subspaces and homomorphic images of identifiable concept classes from positive data. We give sufficient conditions for the identifiable classes to be identifiable from positive data after the applications of those two operations. As one of the examples to show the effectiveness of the obtained theorems, we will apply them to the class of zero-reversible languages, and obtain some interesting identifiable language classes related to reversible languages. Further, we will show a connection of those theories to the theory of approximate identification in the limit from positive data([Kob96]). Another important contribution of this paper is am algebraic extension of Angluin's theorem in [Ang80] based on am algebraic characterization of zero-reversible languages given by [Pin87]. This generalized theorem tells us the importaace of Pin's chazacterization of zero-reversible languages using finitely generated groups in the context of identification in the limit from positive data.

AB - In this paper, we study two operations of taking subspaces and homomorphic images of identifiable concept classes from positive data. We give sufficient conditions for the identifiable classes to be identifiable from positive data after the applications of those two operations. As one of the examples to show the effectiveness of the obtained theorems, we will apply them to the class of zero-reversible languages, and obtain some interesting identifiable language classes related to reversible languages. Further, we will show a connection of those theories to the theory of approximate identification in the limit from positive data([Kob96]). Another important contribution of this paper is am algebraic extension of Angluin's theorem in [Ang80] based on am algebraic characterization of zero-reversible languages given by [Pin87]. This generalized theorem tells us the importaace of Pin's chazacterization of zero-reversible languages using finitely generated groups in the context of identification in the limit from positive data.

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

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

U2 - 10.1007/3-540-63577-7_35

DO - 10.1007/3-540-63577-7_35

M3 - Conference contribution

AN - SCOPUS:84958046614

SN - 3540635777

SN - 9783540635772

VL - 1316

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

SP - 48

EP - 61

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

PB - Springer Verlag

ER -