Are the automata A and A’ shown below equivalent?

Are automata A−,A−' equivalent.

Given information:

Concept used:

If the quotient transition diagram of the two automata are same then the two automata are equivalent.

Calculation:

For A :

0− Equivalence classes - Two states are zero equivalent if both are accepting states or both are non-accepting states. Therefore, the 0-equivalance classes are: {s1,s2,s4,s5},{s0,s3}.

1− Equivalence classes — Two states are 1− equivalent if, and only if they are 0− equivalent and, after input of any symbol, their next state are 0− equivalent. Therefore, the 1− equivalence classes are: {s1,s2},{s4,s5},{s0,s3}

2− Equivalence classes — two states are called 2− equivalent if, 2− and only ¡f they are 1− equivalent and. after input of any symbol, their next state are 1− equivalent. Therefore the 2− equivalent classes are: {s1},{s2},{s4,s5},{s0,s3}

3− Equivalence classes — two states are called 3− equivalent if, and only if they are 2− equivalent and. after input of any symbol, their next state are 2− equivalent