GATE | GATE-CS-2015 (Mock Test) | Question 16

How many minimum states are required in a DFA to find whether a given binary string has odd number of 0’s or not, there can be any number of 1’s.
(A) 1
(B) 2
(C) 3
(D) 4

Answer: (B)
Explanation:
Quiz of this Question

Article Tags :

GATE

GATE-CS-2015 (Mock Test)

GATE-GATE-CS-2015 (Mock Test)

Recommended Articles

1. GATE | GATE-CS-2015 (Mock Test) | Question 2

2. GATE | GATE-CS-2015 (Mock Test) | Question 17

3. GATE | GATE-CS-2015 (Mock Test) | Question 5

4. GATE | GATE-CS-2015 (Mock Test) | Question 10

5. GATE | GATE-CS-2015 (Mock Test) | Question 10

6. GATE | GATE-CS-2015 (Mock Test) | Question 8

7. GATE | GATE-CS-2015 (Mock Test) | Question 9

8. GATE | GATE-CS-2015 (Mock Test) | Question 10

9. GATE | GATE-CS-2015 (Mock Test) | Question 11

10. GATE | GATE-CS-2015 (Mock Test) | Question 17

11. GATE | GATE-CS-2015 (Mock Test) | Question 13

12. GATE | GATE-CS-2015 (Mock Test) | Question 14

13. GATE | GATE-CS-2015 (Mock Test) | Question 17

14. GATE | GATE-CS-2015 (Mock Test) | Question 17

15. GATE | GATE-CS-2015 (Mock Test) | Question 4

16. GATE | GATE-CS-2015 (Set 1) | Question 65

17. GATE | GATE-CS-2015 (Set 1) | Question 65

18. GATE | GATE-CS-2015 (Set 1) | Question 3

19. GATE | GATE-CS-2015 (Set 1) | Question 65

20. GATE | GATE-CS-2015 (Set 1) | Question 65

21. GATE | GATE-CS-2015 (Set 1) | Question 65

22. GATE | GATE-CS-2015 (Set 1) | Question 65

23. GATE | GATE-CS-2015 (Set 1) | Question 65

24. GATE | GATE-CS-2015 (Set 1) | Question 9

25. GATE | GATE-CS-2015 (Set 1) | Question 10