申論題

5. Convert the following finite state machine to another machine where every two transitions becomes one. That is, we have two alphabets, one after another in each transition in the new machine while all the states remain to be the same to the original machine. We assume the starting state is A.