UP EEEI CoE 23 Lecture 2 (Alvarez 2017) 1

COE 23
Lecture 2
State Minimization
UP EEEI CoE 23 Lecture 2 (Alvarez 2017) 2

State Minimization

Reduce number of states by eliminating redundant states /

transitions.
Easier system analysis

Simplify system representation

Reduce implementation costs

UP EEEI CoE 23 Lecture 2 (Alvarez 2017) 3

State Minimization Methods

Reduction by Inspection
Carefully inspect the State Table for entries or present states
that lead to the same next state and produce the same output
value.
Reduction by Partition
Uses a Partition Table to separate states that can not be
equivalent.
Reduction by Implication
Uses an Implication Table to determine implied equivalents.
UP EEEI CoE 23 Lecture 2 (Alvarez 2017) 4

Reduction by Inspection
UP EEEI CoE 23 Lecture 2 (Alvarez 2017) 5

Reduction by Inspection
UP EEEI CoE 23 Lecture 2 (Alvarez 2017) 6

Reduction by Inspection
UP EEEI CoE 23 Lecture 2 (Alvarez 2017) 7

Reduction by Partitioning

Group states according to output combinations.

When two states, p and q, lead to next states which

belong to different classes, then these next states have
different output values and can not be equivalent.
Therefore p and q must not be placed in the same class.

States that belong to the same class at the end of all

the iterations are said to be equivalent.
UP EEEI CoE 23 Lecture 2 (Alvarez 2017) 8

Reduction by Partitioning

CLASS = set of combinations

of outputs
Output
combinations

Class 1: 01 (A,D,E,G,H)
Class 2: 11 (B,C,F,I)
States in
each class
UP EEEI CoE 23 Lecture 2 (Alvarez 2017) 9

Partition Table

(01 output combination) (11 output combination)

Class of the Next States

UP EEEI CoE 23 Lecture 2 (Alvarez 2017) 10

Reduction by Partitioning

Stop when each class in the Partition Table

contains only states with the same next
classes.

Therefore, there are only 4 unique states!

UP EEEI CoE 23 Lecture 2 (Alvarez 2017) 11

Reduction by Implication
Step 1: Make a State Implication Table. The
first state is not included in the rows and the
last state is not included in the columns.
UP EEEI CoE 23 Lecture 2 (Alvarez 2017) 12

Reduction by Implication

Step 2a: Put an X in a box corresponding to a pair of states

whose outputs are not equal for every input.

Step 2b: Put a in a box corresponding to a pair of states

which are equivalent, or the pairs of states implied by their
equivalence. All boxes should now contain an X, a or the
states implied by their equivalence.
UP EEEI CoE 23 Lecture 2 (Alvarez 2017) 13

Reduction by Implication
UP EEEI CoE 23 Lecture 2 (Alvarez 2017) 14

Reduction by Implication
Step 3: Cross out a box if it contains at least one implied pair that
is not equivalent. Check a box if its implied pairs are equivalent.
UP EEEI CoE 23 Lecture 2 (Alvarez 2017) 15

Reduction by Implication
Step 3: Cross out a box if it contains at least one implied pair that
is not equivalent. Check a box if its implied pairs are equivalent.
UP EEEI CoE 23 Lecture 2 (Alvarez 2017) 16

Reduction by Implication
Step 4: Continue looking for equivalent and non-equivalent states.
Stop when all implied pairs in all boxes have been resolved.

Therefore, there are 4 unique states!