# Recent questions tagged myhill-nerode

1
hello, i've just solved 2 questions among many, but i'm not sure i've got to the right result. could you check if i did it correctly(especially 2) as it's more complicated). both are over $\Sigma = \{a,b,c\}$ ... find the separating words between the equivalence classes. could you help me with that please? thank you very much for your help, really hoping i did it correctly.
2
Consider the following DFA: The number of distinct sets present in all partitions while converting given DFA into minimal DFA using Myhill-Nerode theorem is ________.
3
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 ______.
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 equivalence classes here...