Consider the set of all words over the alphabet $\{x, y, z\}$ where the number of $y$’s is not divisible by 2 or 7 and no $x$ appears after a $z$. This language is:
- regular
- not known to be regular
- context-free but not regular
- recursively enumerable but not context-free