(Solved) : 5 Answer Following Questions Yes Indicate Whether Following Languages Decidable Guess Unsu Q26729593 . . . .

5. Answer each of the following questions with onlyYES or NO to indicate whether ornot the following languages aredecidable. Do not guess if unsure, aswrong answers will lower your score!

a.{D: D is adeterministic finite automaton and L(D) = }

b.{P: P is apushdown automaton and L(P) = }

c.{M: M is a Turingmachine and L(M) = }

d.{D1,D2: D1 andD2 are deterministic finite automata andL(D1) = L(D2)}

e.{P1,P2: P1 andP2 are pushdown automata andL(P1) = L(P2)}

f.{M1,M2: M1 andM2 are Turing machines andL(M1) = L(M2)}

g.{M: M is a Turingmachine that has a state named q27}

h.{M: M is