CS 334 Automata and Computation

Problem 3. (10 points) Modify the proof of Theorem 1.25 in the textbook to cover the case when the machines M1, M2 have different input alphabets , 2. Hint: the machine M that recognizes the union of the languages of M,, M2 will have input alphabet -,U 2. Take care when defining 8((ri,T2), a) as the symbol a could belong to one alphabet but not the other! Problem 3. (10 points) Modify the proof of Theorem 1.25 in the textbook to cover the case when the machines M1, M2 have different input alphabets , 2. Hint: the machine M that recognizes the union of the languages of M,, M2 will have input alphabet -,U 2. Take care when defining 8((ri,T2), a) as the symbol a could belong to one alphabet but not the other