1. Prove that in an FSM with n states, at most n − 1 constructions of the equivalence classes are needed, i.e. one needs to construct only P1,P2, ... ,Pn−1. 2. Given the FSM of Example 5.6, construct...

1. Prove that in an FSM with n states, at most n − 1 constructions of the equivalence classes are needed, i.e. one needs to construct only P1,P2, ... ,Pn−1.

2. Given the FSM of Example 5.6, construct all mutants that can be obtained by adding a state to M.

May 26, 2022