| 作成者 |
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 号 |
|
| 開始ページ |
|
| 終了ページ |
|
| 出版タイプ |
|
| アクセス権 |
|
| Crossref DOI |
|
| 関連DOI |
|
|
|
| 関連URI |
|
|
|
| 関連情報 |
|
|
|
| 概要 |
Inductive inference of a language $ L $ from negative data is the one based only on words not in $ L $. In other words it is the inference of the complement $ L^c $ from positive data. This paper desc...ribes the relation between inferability from positive data and that from negative data. It is not the case that the inferability of a class of languages always guarantees the inferability from negative data. Some non trivial classes are inferable both from positive data and from negative data.続きを見る
|
Mendeley出力
