Complementation of Buchi automata revisited (1999) [9 citations — 3 self]
Download:
|
|
by Wolfgang Thomas
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
http://www-i7.informatik.rwth-aachen.de/~thomas/papers/buecomp.ps.gz
Add To MetaCart
Abstract:
Abstract. As an alternative to the two classical proofs for complementation of Buchi automata, due to Buchi himself and to McNaughton, we outline a third approach, based on stratified alternating automata with a "weak " acceptance condition. Building on work by Muller, Saoudi, Schupp (1986) and Kupferman and Vardi (1997), we present a streamlined version of this complementation proof. An essential point is a determinacy result on infinite games with a weak winning condition. In a unifying logical setting, the three approaches are shown to correspond to three different types of second-order definitions of!-languages. 1
Citations
| 241 | On a decision method in restricted second order arithmetic – Büchi - 1962 |
| 67 | Testing and generating infinite sequences by a finite automaton – McNaughton - 1966 |
| 44 | Alternating automata. The weak monadic theory of the tree, and its complexity – Muller, Saoudi, et al. - 1986 |
| 6 | Alternating automata on infinite trees, Theoretical Computer Science 54 – Muller, Schupp - 1987 |
| 3 | Weak alternating automata are not so weak – Kupferman, Vardi - 1997 |
| 3 | Methods for the transformation of !-automata: Complexity and connection to second order logic – Loding - 1998 |
| 1 | Alternating finite automata on !-words, Theor – Miyano, Hayashi - 1984 |
