An emptiness-check algorithm tells whether the language recognized by an automaton is empty. On a Büchi automaton this operation is not straightforward since you have to check whether there exist a run of the automaton that fulfills that acceptance conditions. Several EmptinessCheckAlgorithms have been published to address this problem.
