Question

2. (10 points) Determine whether the following languages are decidable, recognizable, or undecidable. Briefly justify your answer for each statement. 1) L! = {< D,w >. D is a DFA and w E L(D)} 2) L2- N, w> N is a NF A and w L(N) 3) L,-{< P, w >: P is a PDA and w ㅌ L(P); 4) L,-{< M, w >: M is a TM and w e L(M)} 5) L,-{< M, w >: M is a TM and w E L(M)}

Answer 1

ウ e will be uch that a sbangw to the does nst deeidable the qiven to isen NFA. LA) lanq to the deaolable, the given DECIDABLE 3. Pis 'n Puuh duon automata CPDA) and the languages L3 บ a lar,unge couating talt d.ings.o belonging ski buepe, is decidan DECIDABLE iOCNS) CNK 4. MİS TM Enumeralble language . L4C)ll e a e ceniuti to jo RE

spondina to Lm) e cea90 umeua ce centingeal to LCM). Sncmsip n E le rgunges丿the 'gion language 15 a lanquage ne L(M deddable 4et pe JUndec dable