PPT Slide
7 – Sequential Logic Examples
Finite string pattern recognizer (step 3)
S2 and S5 still have incomplete transitions
- S2 = …01; If next input is 1, then string could be prefix of (01)1(00) S4 handles just this case
- S5 = …10; If next input is 1, then string could be prefix of (10)1(0) S2 handles just this case
Reuse states as much as possible
- look for same meaning
- state minimization leads to smaller number of bits to represent states
Once all states have a complete set of transitions we have a final state diagram