| 作成者 |
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 号 |
|
| 開始ページ |
|
| 終了ページ |
|
| 出版タイプ |
|
| アクセス権 |
|
| Crossref DOI |
|
| 関連DOI |
|
|
|
| 関連URI |
|
|
|
| 関連情報 |
|
|
|
| 概要 |
Our purpose in this paper is to construct a practical algorithm to inductively infer context-free languages. A basic procedure is first introduced to take out the self-embedding structure from given s...trings. Secondly, based on this procedure an algorithm to infer linear grammars from given finite sample sets is presented and its completeness is proved. Finally, by using a method to compose linear grammars, we propose an algorithm which is also complete for context-free languages.続きを見る
|
Mendeley出力
