1,367 views
2 votes
2 votes

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.

1 Answer

Related questions

3 votes
3 votes
2 answers
1
Sona Barman asked Jan 15, 2018
2,284 views
Self doubt:Is there any method to calculate number of states in dfa e.g."x mod y" type of question without drawing dfa?Because in Gate time is vital factor.
1 votes
1 votes
0 answers
2
Warlock lord asked Nov 12, 2017
2,156 views
L = {s ∈ (0 + 1)* d(s)mod5 = 2 or d(s)mod7 != 4} where d(s) is the decimal equivalent of the binary string s.How many states does the above DFA have? How many final sta...
2 votes
2 votes
1 answer
3
rahul sharma 5 asked Nov 9, 2017
936 views
Minimum number of states in DFA where:, Number of a's and Number of b's are even and epsilon is not accepted.Langugae is defined over {a,b}
0 votes
0 votes
2 answers
4