1 Answers


A classical result, attributed toMeyer and Stockmeyer, is that checking whether an NFA accepts all strings is PSPACE-complete. Nevertheless, there are some non-trivial heuristic algorithms. See for exampleAntichains: A New Algorithm for Checking Universality of Finite Automataby De Wulf, Doyen, Henzinger and Raskin.