| 作成者 |
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 号 |
|
| 開始ページ |
|
| 終了ページ |
|
| 出版タイプ |
|
| アクセス権 |
|
| Crossref DOI |
|
| 関連DOI |
|
|
|
| 関連URI |
|
|
|
| 関連情報 |
|
|
|
| 概要 |
A pattern is a string of constant symbols and variable symbols. The language $ L(p) $ of a pattern $ p $ is the set of all strings obtained by substituting any non-empty constant string for each varia...ble symbol in $ p $. In this paper we consider inference from positive data for unions of two pattern languages, that is, identification of $ L(p) smile L(q) $ when an enumeration of elements in the union is given.続きを見る
|
Mendeley出力
