301 Lab Week 13 Julian Coward . NetID: Jeowar 3 A Decidable Languages hat the language = {(D, R) | D is a DFA and R is a RegEx, D and R have equivalent languages} able. Either give an algorithm which decides it, or show a reduction to a decidable e. Recall that in lecture, we showed/stated that A is decidable for DFA, NFA, CFG; idable for DFA, CFG; and EQ is decidable for DFA. new PEA C s.t. L(c)= e a