Question: 3. (10 points) Consider the following computational problems over a fixed alphabet ?. L(A) } ADFA-{(A, te) | A is a DFA over ?, w

3. (10 points) Consider the following computational problems over a fixed alphabet ?. L(A) } ADFA-{(A, te) | A is a DFA over ?, w ? ?*, w EDFA-((A> 1 A is a DFA over ?, L(A)-0) EQDFA-{(A, B> 1 A and B are DFAs over ? and L(A)-L(B)) SUBDFA-{(A,B) 1 A and B are DFAs over ? and L(A) L(B) } ALLDFA-(A) 1 A is a DFA over ?, L(A)-?*) INFDFA-(A) 1 A is a DFA over ?, L(A) is (countably) infinite) a. Find all subset relations between distinct sets in this list. That is, determine when ??DFA C ??DFA b. Find all pairs of sets in this list that are not disjoint. That is, determine when ??DFA n??DFA 0
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
