Q1> How many numbers of states are there in minimal DFA for the following languages formed over input = {a, b}
1. a div by 2 and b not div by 3.
2. a not div by 3 and b div by 4.
3. a div by 2 and b at least 2.
4. a at least 2 or b at least 3.
5. a exactly 2 and b at least 3.
6. a exactly 3 and b at most 3
7. a exactly 2 or b at least 2.
8. a exactly 4 and b at least 2.
Q2> How many numbers of states are there in minimal DFA for the following languages formed over input = {a, b, c}
1. a div by 2 and b not div by 3 and c div by 6.
2. a not div by 3 and b div by 4 and c at least 3.
3. a div by 2 and b at least 2 and c at most 4.
4. a at least 2 or b at least 3 or c at least 4.
5. a exactly 2 and b at least 3 and c at most 2.
6. a exactly 3 and b at most 3 and c exactly 3.
7. a exactly 2 or b at least 2 and c at most 5.
8. a exactly 4 and b at least 2 or c exactly 4.
How to calculate the number of states in such question.
It will be good if someone tells how to draw the DFA of such question.