COMP4141 Theory of Computation Exam
(7 × 2 = 14 marks) For each of the following statements answer whether they are TRUE, FALSE, or OPEN (answer not currently known). Answers should be justified. (a) The following language is decidable: {⟨M, N⟩ : M is a DFA and N is a PDA and L(M) ⊆ L(N)} (b) There exists a recursively […]
COMP4141 Theory of Computation Exam Read More »