CSCI 255, ENGR 274, ECE 212 -- 21 November, 2000
Announcements
Finite State Machine reduction
State Assignment
Try to assign similar states to similar bit-encodings.
- Heuristic priroities for closeness
- States with same next states for input transisitions
- States and successor states
- States with same output for inputs
Non-determinate Finite String Recognizers
- Non determinate choice
- Two transistions with the same input
- The ε transistion
- NDFSM → FSM