3. (10 points) Define S = {(M, N〉, M and N are DFAs and L(M) C L(N)). Show that s is recursive. Show transcribed image text 3. (10 points) Define S = {(M, N〉, M and N are DFAs and L(M) C L(N)). Show that s is recursive.
Answer
3. (10 points) Define S = {(M, N〉, M and N are DFAs and L(M) C L(N)). Show that s is recursive. Show transcribed image text 3. (10 points) Define S = {(M, N〉, M and N are DFAs and L(M) C L(N)). Show that s is recursive.
Answer