Discrete Structure: Finite Automata

Question 2 Let A = (S, I, O, A, f, g) be a finite state machine (FSM) defined by the transition table shown in Table 2. Table 2: Transition table of FSM A Input y y State B 0 1 0 B B B 1 1 B 1 0 0 i) Draw the transition diagram of the finite state machine A. ii) Find the output string for the input string xyxzx. iii) Find the output generated from the input string zxyxz. iv) Determine whether the input string zxyxz is accepted by the FSM