Consider the problem of determining whether a DFA and a regular expression are equivalent. Express this problem as a language and show that it is decidable. Consider the problem of determining whether a DFA and a regular expression are equivalent. Express this problem as a language and show that it is decidable