申論題

4. Let I={0, 1} be the input alphabet and O = {0, 1} be the output aplphabet of a finite state machine that recognizes all strings in the language {0, 1}* {01} {0, 1}⁺. Please draw a state diagram for the finite state machine after minimization.