论文信息 - Alternating Automata. The Weak Monadic Theory of the Tree, and its Complexity - 字舞流文

Alternating Automata. The Weak Monadic Theory of the Tree, and its Complexity

David E. Muller | Ahmed Saoudi | Paul E. Schupp

[1] David E. Muller,et al. Alternating automata on infinite objects, determinacy and Rabin's theorem , 1984, Automata on Infinite Words.

[2] M. Rabin. Weakly Definable Relations and Special Automata , 1970 .

[3] David E. Muller,et al. The Theory of Ends, Pushdown Automata, and Second-Order Logic , 1985, Theor. Comput. Sci..

[4] M. Rabin. Decidability of second-order theories and automata on infinite trees. , 1969 .