5. Answer each of the following questions with only YES or NO to indicate whether or not the following languages are decidable. Do not guess if unsure, as wrong answers will lower your score!

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

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

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

d.{D₁, D₂: D₁ and D₂ are deterministic finite automata and L(D₁) = L(D₂)}

e.{P₁, P₂: P₁ and P₂ are pushdown automata and L(P₁) = L(P₂)}

f.{M₁, M₂: M₁ and M₂ are Turing machines and L(M₁) = L(M₂)}

g.{M: M is a Turing machine that has a state named q₂₇}

h.{M: M is a Turing machine with a transition to q₂₇ in its delta function}

i.{M, w: M is a Turing machine that enters its state q₂₇ when run on input string w}

j.{M: M is a Turing machine that enters its state q₂₇ when run on any (that is, at least one) string}

k. Which of the above problems are Turing acceptable?