A state-machine specification is complete if and only if there is a transition specified for every possible combination of state and input symbol. We can change an incomplete specification to a complete one by adding an extra state, called a trap state. Once a transition is made to the trap state, the system remains in the trap state, no matter the input. For example, if 0, 1, and 2 are the only possible inputs, the system depicted by Figure 4.33 can be completed by adding a trap state as shown in Figure 4.34. In same manner, complete your state-machine specification from Question 1. Reference: Textbook, chapter 4, page 220, Exercise #8 Textbook: Software Engineering Theory and Practice 4th Edition

Original system for FIGURE 4.33 Exercise 7 Si S2 Section 4.19 Exercises FIGURE 4.34 Complete system with trap state for Exercise 7. Si S2 S, Original system for FIGURE 4.33 Exercise 7 Si S2 Section 4.19 Exercises FIGURE 4.34 Complete system with trap state for Exercise 7. Si S2 S