b) Let A = (S, I, O, X. f. g) be the Finite State Machine (FSM)...

Transcribed Image Text:

b) Let A = (S, I, O, X. f. g) be the Finite State Machine (FSM) defined by the transition diagram shown in Figure 6. b/0 a/0 b/1 a/1 c/1 c/0 XE/1 Y a/1 b/0 Figure 6 i) Find the output string for the input string babbab. (2 marks) ii) Determine whether the input string aabcabb is accepted or not by the FSM. iii) State one input string with length of three that accepted by the FSM. (2 marks) (2 marks) -8- b) Let A = (S, I, O, X. f. g) be the Finite State Machine (FSM) defined by the transition diagram shown in Figure 6. b/0 a/0 b/1 a/1 c/1 c/0 XE/1 Y a/1 b/0 Figure 6 i) Find the output string for the input string babbab. (2 marks) ii) Determine whether the input string aabcabb is accepted or not by the FSM. iii) State one input string with length of three that accepted by the FSM. (2 marks) (2 marks) -8-