Automata on Infinite Trees

Wikipedia'ya provami tabi ki burada yapacagimdir...
Possible Entries:

• Alternating Tree Automata: In contrast to tree automata which have transitions that lead to one state per successor of current node, these automata may send multiple copies along one branch or may not send a copy along some branch at all. As with other tree automata several acceptance conditions can be used like Sttreet, Rabin, Parity, Muller and Buchi. However, unlike A.A. on infinite words, A.T.A. are not equivalent to nondeterministic automata on infinite trees but are more powerful. Fortunately, modal mu-calculus properties may be translated into such A.T.A. that in turn be translated into N.T.A. (Hence, the equality of expression of the two formalisms.)

[EJ91]: What is new is the translation from "history free" A.T.A. to N.T.A. As far as I understand (which may not be far) the translation from modal mu-calculus to A.T.A was done in [MS84]. (In any case, in order to translate one has to construct the A.T.A.s in a certain manner, at least one needs a grasp of them)

Construction: Given Phi, we construct an A.T.A. A such that A accepts exactly those trees labeled with Prop, which are models of Phi. (Phi is the set of propositional symbols in Phi) ...

To be continued...

Important Notice to Meself!: i write to my blog, not my thesis.