Testing regular expressions algorithmically 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?
Hint: Check whether there is a path from the starting state to some accepting state.