6.2.2 Emptyness

Next we want to test, whether the language of a given automaton accepts something.

p in reach (p,l,q) in D -------------------------------------- q in reach

p in init -------------------------------------- p in reach

p in reach p in fin -------------------------------------- nonempty