Equivalence classes

Question

Consider a regular language L over Σ={0,1} such that L contains every string which ends with "0". The number of equivalence classes in L is ______.

Comments

no of state in minimal DFA

---

equivalence classes is the number of states in minimum dfa

---

@ Parshu gate  equivalence class is nothing but number of states required to build a DFA ,here you need 2 states.

Answer 1

Number of Equivalence class is equal to the Number of State in the Minimal DFA.

There are 2 state in Minimal DFA. so the number of equivalence class is 2.