Software Testing (Finite State Machine) Testing Tree:

Can someone solve this problem please:

a) Draw the Finite State Machine testing tree.

b) What is the transition cover set for the Finite State Machine?

~~~~~~~~~~~

Given a finite state machine with input alphabet ta, b) output alphabet 10,1) that will recognize the substring abba It outputs 0's until recognizing a substring, then outputs a 1. It recognizes overlapping substrings The FSM does not terminate. The initial state is q0. a/O a/O b/0 b/0 blo a/O blo Current output Next state State q3 Given a finite state machine with input alphabet ta, b) output alphabet 10,1) that will recognize the substring abba It outputs 0's until recognizing a substring, then outputs a 1. It recognizes overlapping substrings The FSM does not terminate. The initial state is q0. a/O a/O b/0 b/0 blo a/O blo Current output Next state State q3