Full disclosure: I am trying to understand an answer from the Stanford Automata MOOC.

Why are states F and G equivalent here, such that they would get merged in a minimization process? They both differ on their transitions on 0, so I thought they were distinguishable?

```
    0   1
->A E   D
*B  A   C
C   G   B
D   E   A
*E  H   C
F   C   B
G   F   E
H   B   H

```