Show that a language is decidable. Show that {M | M is a DFA whose language is empty} is decidable Hint: Check if M has a path from the initial state to some final state. If it does not, then L(M) is...

Show that a language is decidable. Show that {M | M is a DFA whose language is empty} is decidable

Hint: Check if M has a path from the initial state to some final state. If it does not, then L(M) is empty. A graph exploration algorithms such as depth first search or breadth first search can be used to check if there is a path from the initial state to some final state.