# Minimalization of finite automaton

### S = {A, B, C, D, E}

### Σ = {0, 1}

### Transitions:

(A, 0, E)

(A, 1, B)

(B, 0, C)

(B, 1, B)

(C, 0, D)

(C, 1, B)

(D, 0, D)

(D, 1, D)

(E, 0, E)

(E, 1, B)

### Initial State(s) = {A}

### Final State(s) = {D}

### After Minimalization (Subset Construction)

### S = {A-E, B, C, D}

### Σ = {0, 1}

### Transitions:

(A-E, 0, A-E)

(A-E, 1, B)

(B, 0, C)

(B, 1, B)

(C, 0, D)

(C, 1, B)

(D, 0, D)

(D, 1, D)

### Initial State(s) = {A}

### Final State(s) = {D}