MADE EASY 2022 Work book -Theory of Computation series

Question

Let L be a regular language on alphabet Σ. The union of the myhill-nerode equivalence classes is always _____, and the pairwise intersection of the myhill-nerode equivalence classes is

always Fill up the blanks

Comments

it is option C.

Answer 1

Option C

Union of all myhill-nerode equivalence classes is always set of all languages i.e., $\Sigma^*$

Pairwise Intersection of myhill-nerode equivalence classes is always $\emptyset$ (because all myhill-nerode equivalence classes are mutually exclusive)