1,312 views
1 votes
1 votes
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 ______.

1 Answer

0 votes
0 votes

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.

Related questions

7 votes
7 votes
2 answers
2
resuscitate asked Dec 5, 2015
11,911 views
The number of equivalence classes which exist for the following regular expression R are ______. $R=(a+b)^*b(a+b+\epsilon )$ what is the meaning of equivale...
4 votes
4 votes
2 answers
3
praj asked Aug 18, 2015
4,356 views
Find all the equivalence classes of Regular Language011 (0+1)* 011