(a) Show how to translate strings of zeros and ones with a finite state machine, so that M1 accepts a string s if and only if M2 accepts the translation of s.
(b) Does the existence of this translation show that M1 can simulate M2, or that M2 can simulate M1?
(c) Do you think you can find a similar translation in the opposite direction, so that M2 accepts a string s if and only if M1 accepts the translation of s? Why or why not?
(d) If the reverse translation does not exist, what would that imply about the possibility that M1 or M2 might be universal?