Is it possible that a context-free-language has infinite myhill-nerode-classes or is there a way to narrow down (in terms of chomsky hierachy) which kind of classes can or can't have infinite myhill-nerode-classes?
I have a problem where I should show via the pumping-lemma for context-free languages that the language a^(3n+2)$b^(3n+2) with the alphabet {a,b,$} has infinite myhill-nerode-equivalence-classes.
