acetest series

Question

construct dfa over {a} accepting all strings which have number of a's divisible by 2 and no of a's divisible by 4. what is the minimum no of states in dfa?

ans is 2 states??

Comments

yes, 2 states needed.

---

aa is not in language !

Answer 1

is there "AND" or "OR" between these two conditions ??

if "AND" is there then there will be 4 states.

If "OR" is there then there will be 2 states.