Creator |
|
|
Language |
|
Publisher |
|
|
Date |
|
Source Title |
|
Vol |
|
Issue |
|
First Page |
|
Last Page |
|
Publication Type |
|
Access Rights |
|
Crossref DOI |
|
Related DOI |
|
|
Related URI |
|
|
Relation |
|
|
Abstract |
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.show more
|