A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
The introduction of an efficient determinisation technique for Büchi automata by Safra has been a milestone in automata theory. To name only a few applications, efficient determinisation techniques for ω-word automata are the basis for several manipulations of ω-tree automata (most prominently the nondeterminisation of alternating tree automata) as well as for satisfiability checking and model synthesis for branching-and alternating-time logics. This paper proposes a determinisation techniquedoi:10.1007/978-3-642-00596-1_13 fatcat:lso7d57zzzcz7oe4zyt37qotom