Tree Automata, Mu-Calculus and Determinacy (Extended Abstract)
暂无分享,去创建一个
[1] P. Wolfe. The strict determinateness of certain infinite game , 1955 .
[2] Y. Moschovakis. Descriptive Set Theory , 1980 .
[3] Robert S. Streett. Propositional Dynamic Logic of looping and converse , 1981, STOC '81.
[4] Yuri Gurevich,et al. Trees, automata, and games , 1982, STOC '82.
[5] Dexter Kozen,et al. RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .
[6] J. Richard Büchi. State-Strategies for Games in F G , 1983, J. Symb. Log..
[7] Damian Niwinski. On Fixed-Point Clones (Extended Abstract) , 1986, ICALP.
[8] E. Muller David,et al. Alternating automata on infinite trees , 1987 .
[9] E. Allen Emerson,et al. On simultaneously determinizing and complementing omega -automata , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.
[10] Allan Borodin,et al. On the power of randomization in online algorithms , 1990, STOC '90.
[11] Wolfgang Thomas,et al. Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.