As a basic introduction to decidability, I have been asked to think about these two questions and would like your help:
E* = Sigma Star
e = epsilon
1.) Let ALLDFA = { is DFA and L(A) = E*} Show that ALLDFA is decidable.
For this, sense the language of A is in the set of all languages, would showing this just involve making a DFA of one state that accepts everything? I am not sure how to show this.
2.) Let AeCFG = { if CFG that generates e}. Show that AeCFG is decidable.
For this, isn't there a theorem that says that ALL CFG's are decidable?