Büchi Complementation Made Tight

  title={B{\"u}chi Complementation Made Tight},
  author={Sven Schewe},
The precise complexity of complementing Büchi automata is an intriguing and long standing problem. While optimal complementation techniques for finite automata are simple – it suffices to determinize them using a simple subset construction and to dualize the acceptance condition of the resulting automaton – Büchi complementation is more involved. Indeed, the construction of an EXPTIME complementation procedure took a quarter of a century from the introduction of Büchi automata in the early 60s… CONTINUE READING
Highly Influential
This paper has highly influenced 10 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS