Microsoft Word - A07se4367fsm v1.docxSE4367(SoftwareTesting)Homework#7,FSMTestingTreeGiven a finite state machine with  input alphabet {a, b}  output alphabet {0,1} that...

This is an undergraduate assignment, this requires knowledge in automata theory and software testing. PLEASE DONOT USE CHEGG OR OTHER ONLINE RESOURCES. I WANT PLAGERISM REPORT.


Microsoft Word - A07se4367fsm v1.docx SE4367(SoftwareTesting) Homework#7,FSMTestingTree Given a finite state machine with  input alphabet {a, b}  output alphabet {0,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. Current state Nextstate/Output a b q0 q1/0 q0/0 q1 q1/0 q2/0 q2 q1/0 q3/0 q3 q1/1 q0/0 a) Draw the FSM’s testing tree using the notation from Mathur’s Example 5.11. b) What is the transition cover set for the FSM? Grading Rubric Each of the two parts is worth a maximum of 50 points. a) each wrong node or transition in the testing tree is worth -3 points b) each wrong or missing path in the transition cover set is -5 points