From the diagrams:

• Both machines are deterministic (each state has exactly one transition for each input symbol).

• The first machine has states A and B with transitions on a and b.

• The second machine has states A, B, C, but the accepted language behavior matches the first machine.

Both machines accept the same language, even though the number of states differs.

Thus they are equivalent machines.