论文信息 - Alternating automata on infinite trees - 字舞流文

Alternating automata on infinite trees

E. Muller David | E. Schupp Paul | E. David | E. Paul

[1] On Alternating omega-Automata , 1988, J. Comput. Syst. Sci..

[2] Peter A. Lindsay,et al. Alternation and omega-Type Turing Acceptors , 1986, Theor. Comput. Sci..

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

[4] Satoru Miyano,et al. Alternating Finite Automata on omega-Words , 1984, CAAP.

[5] Yuri Gurevich,et al. Trees, automata, and games , 1982, STOC '82.

[6] Ernst L. Leiss,et al. On Equations for Regular Languages, Finite Automata, and Sequential Networks , 1980, Theor. Comput. Sci..

[7] Y. Moschovakis. Descriptive Set Theory , 1980 .

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

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