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.
By language I think they mean a Turing decidable language? Although I am not 100% sure. The chapter this question came from is titles Decidability and came right after we learned about Turing machines.