Progress measures, immediate determinacy, and a subset construction for tree automata

Using the concept of a progress measure, a simplified proof is given of M.O. Rabin's (1969) fundamental result that the languages defined by tree automata are closed under complementation. To do this, it is shown that for infinite games based on tree automata, the forgetful determinacy property of Y. Gurevich and L. Harrington (1982) can be strengthened to an immediate determinacy property for the player who is trying to win according to a Rabin acceptance condition. Moreover, a graph-theoretic duality theorem for such acceptance conditions is shown. Also presented is a strengthened version of S. Safra's (1988) determinization construction. Together these results and the determinacy of Borel games yield a straightforward method for complementing tree automata.<<ETX>>

[1]  Vladimir Yakhnis,et al.  Extension of Gurevich-Harrington's Restricted Memory Determinacy Theorem: A Criterion for the Winning Player and an Explicit Class of Winning Strategies , 1990, Ann. Pure Appl. Log..

[2]  J. Richard Büchi,et al.  Using Determinancy of Games to Eliminate Quantifiers , 1977, FCT.

[3]  Wolfgang Thomas,et al.  A Combinatorial Approach to the Theory of omega-Automata , 1981, Inf. Control..

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

[5]  N. Klarlund.  Progress Measures and Finite Arguments for Infinite Computations , 1990 .

[6]  Moshe Y. Vardi,et al.  On omega-Automata and Temporal Logic (Preliminary Report) , 1989, STOC 1989.

[7]  Moshe Y. Vardi,et al.  On ω-automata and temporal logic , 1989, STOC '89.

[8]  Dana S. Scott,et al.  Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..

[9]  Nils Klarlund,et al.  Progress measures and stack assertions for fair termination , 1992, PODC '92.

[10]  Nils Klarlund,et al.  Rabin measures and their applications to fairness and automata theory , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[11]  David E. Muller,et al.  Alternating Automata on Infinite Trees , 1987, Theor. Comput. Sci..

[12]  S. Safra.  On The Complexity of w-Automata , 1988 .

[13]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

[14]  Nils Klarlund,et al.  Progress measures for complementation omega -automata with applications to temporal logic , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

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

[16]  E. Allen Emerson,et al.  On simultaneously determinizing and complementing omega -automata , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[17]  J. R. Büchi.  On a Decision Method in Restricted Second Order Arithmetic , 1990 .

[18]  E. Muller David,et al.  Alternating automata on infinite trees , 1987 .

[19]  Robert McNaughton,et al.  Testing and Generating Infinite Sequences by a Finite Automaton , 1966, Inf. Control..

[20]  Pierre Wolper,et al.  The Complementation Problem for Büchi Automata with Appplications to Temporal Logic , 1987, Theor. Comput. Sci..

[21]  S. Sieber.  On a decision method in restricted second-order arithmetic , 1960 .

[22]  M. Rabin.  Automata on Infinite Objects and Church's Problem , 1972 .

[23]  David Gale,et al.  13. Infinite Games with Perfect Information , 1953 .

[24]  E. Allen Emerson,et al.  Tree automata, mu-calculus and determinacy , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.