#Regular Language

Question

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:

	(A) regular
	(B) not known to be regular
	(C) context-free but not regular
	(D) recursively enumerable but not context-free

Comments

(it says number of y not divisible by 2 or 7) and (no x appears after a  z).

for both the cases we can make dfa..

i mean dfa1 (intersection) dfa2

which is a DFA.

---

Can you give the regular expression for the lang?

---

its really difficult to make a dfa for this language because of three symbols. i think i will give it a try once