2007/05/31 by Nir Piterman · 1 citation
Computer Science · #cs.LO #cs.FL
paper · pdf · doi:10.2168/lmcs-3(3:5)2007
published as Logical Methods in Computer Science, Volume 3, Issue 3 (August 14, 2007) lmcs:1199 · 21 pages. To appear in Logical Methods in Computer Science (LMCS)
arxiv created 2007/08/14 · arxiv updated 2019/03/14
In this paper we revisit Safra's determinization constructions for automata on infinite words. We show how to construct deterministic automata with fewer states and, most importantly, parity acceptance conditions. Determinization is used in numerous applications, such as reasoning about tree automata, satisfiability of CTL*, and realizability and synthesis of logical specifications. The upper bounds for all these applications are reduced by using the smaller deterministic automata produced by our construction. In addition, the parity acceptance conditions allows to use more efficient algorithms (when compared to handling Rabin or Streett acceptance conditions).