3. (10 points) Define S(M, N) | M and N are DFAs and L(M) g 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) g L(N)). Show that S is recursive.
Answer
3. (10 points) Define S(M, N) | M and N are DFAs and L(M) g 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) g L(N)). Show that S is recursive.
Answer