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.

EmptinessCheck (last edited 2005-02-02 18:47:23 by AlexandreDuretLutz)

All text is available under the terms of the GNU Free Documentation License, see SpotWikiLicense for details.