Applying the Myhill-Nerode Theorem

404 Views Asked by At

Consider the language $$L=\{x y^{(n)} z y^{(n)} w: x,z,w \in \Sigma^*, y \in \Sigma, z\text{ does not contain }y, n \geq 0 \}.$$ To show that the language is not regular using the Myhill-Nerode Theorem, I have to show that there are infinite number of equivalence classes, right? But how can I find these equivalence classes?