(State Partitioning) Given the state diagram in Figure 1, partition the state machine into two communicating finite state machines, one containing the states: S0, S1, S2, S3, and the other containing: S4, S5, S6.
Figure 1
State diagram.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.