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.