This graph represents a chronology of published algorithms for checking Büchi automata for emptiness. Three kinds of automata are distinguished:
Legend |
Büchi automata accepting states |
Generalized Büchi automata with accepting states |
Generalized Büchi automata with accepting transitions (see TGBA) |