Open In App

We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy

GATE | GATE-CS-2015 (Set 2) | Question 65

The number of states in the minimal deterministic finite automaton corresponding to the regular expression (0 + 1)*(10) is ____________
(A) 2
(B) 3
(C) 4
(D) 5

Answer: (B)
Explanation: Below is NFA for the given regular expression (0 + 1)*(10)


Quiz of this Question
Article Tags :
GATE
Recommended Articles
1. GATE | GATE-CS-2015 (Set 1) | Question 65
2. GATE | GATE-CS-2015 (Set 1) | Question 65
3. GATE | GATE-CS-2015 (Set 1) | Question 3
4. GATE | GATE-CS-2015 (Set 1) | Question 65
5. GATE | GATE-CS-2015 (Set 1) | Question 65
6. GATE | GATE-CS-2015 (Set 1) | Question 65
7. GATE | GATE-CS-2015 (Set 1) | Question 65
8. GATE | GATE-CS-2015 (Set 1) | Question 65
9. GATE | GATE-CS-2015 (Set 1) | Question 9
10. GATE | GATE-CS-2015 (Set 1) | Question 10
11. GATE | GATE-CS-2015 (Set 1) | Question 65
12. GATE | GATE-CS-2015 (Set 1) | Question 12
13. GATE | GATE-CS-2015 (Set 1) | Question 65
14. GATE | GATE-CS-2015 (Set 1) | Question 65
15. GATE | GATE-CS-2015 (Set 1) | Question 65
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 19
19. GATE | GATE-CS-2015 (Set 1) | Question 20
20. GATE | GATE-CS-2015 (Set 1) | Question 21
21. GATE | GATE-CS-2015 (Set 1) | Question 65
22. GATE | GATE-CS-2015 (Set 1) | Question 23
23. GATE | GATE-CS-2015 (Set 1) | Question 65
24. GATE | GATE-CS-2015 (Set 1) | Question 65
25. GATE | GATE-CS-2015 (Set 1) | Question 65