| 作成者 |
|
|
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 号 |
|
| 開始ページ |
|
| 終了ページ |
|
| 出版タイプ |
|
| アクセス権 |
|
| Crossref DOI |
|
| 関連DOI |
|
|
|
| 関連URI |
|
|
|
| 関連情報 |
|
|
|
| 概要 |
Finite tree automata on in finite trees which move from the root infinitely are investigated through six types of acceptance conditions. Each condition is an extension of the one used for finite autom...ata on $ omega $-words. We relate the six classes of infinite tree languages with the corresponding classes of $ omega $-languages defined by finite automata, and the relationship among these six classes is established.続きを見る
|
Mendeley出力
