Is it possible to  test algorithmically whether the language of a given automaton is empty?If I have a language L, could I say that L intersection with the empty set is L?
Testing regular expressions algorithmically
algorithms;automata;regular expressions