Given a finite state machine with

- input alphabet {a, b}

- output alphabet {0,1}

that will recognize the substring abba. It outputs 0s until recognizing a substring, then outputs a 1. It recognizes overlapping substrings. The FSM does not terminate. The initial state is q0. a) Draw the FSMs testing tree.

b) What is the transition cover set for the FSM?

a/0 a/0 b/0 a/O qo blo Current output State b/0 q13 blo Next state q1. q1 q1