FINITE TREE AUTOMATA ON INFINITE TREES
Takeshi Hayashi, Satoru Miyano · Bulletin of informatics and cybernetics · 1985
Finite tree automata on infinite 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 automata on w words. We relate the six classes of infinite tree languages with the corresponding classes of wlanguages defined by finite automata, and the relationship among these six classes is established. 1.