? = { a, b }

? = { a,b, #,0,1 }

4. Consider the following language over alphabet (2'US)) ?4 = { w1 $ w2 | w1 is a valid encoding of a TM algorithm, MI, and w2 is a valid encoding of a DFA, M2; and one input string in (a, b)' accepted by M1 and M2 Describe (briefly in English) a procedure for recognizing 4. Consider the following language over alphabet (2'US)) ?4 = { w1 $ w2 | w1 is a valid encoding of a TM algorithm, MI, and w2 is a valid encoding of a DFA, M2; and one input string in (a, b)' accepted by M1 and M2 Describe (briefly in English) a procedure for recognizing