Question: question 1 is write a statemachine specification to illustrate requirements...
QUESTION 1 IS
Write a state-machine specification to illustrate requirements of an automatic banking machine (ABM).
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.