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 1999 | Question 4

Consider the regular expression (0+1)(0+1)… n times. The minimum state finite automaton that recognizes the language represented by this regular expression contains:
(A) n states
(B) n+1 states
(C) n+2 states
(D) None of the above

Answer: (B)
Explanation:
Quiz of this Question
Please comment below if you find anything wrong in the above post

Article Tags :
GATE
Recommended Articles
1. GATE | GATE CS 1999 | Question 36
2. GATE | GATE CS 1999 | Question 26
3. GATE | GATE CS 1999 | Question 27
4. GATE | GATE CS 1999 | Question 28
5. GATE | GATE CS 1999 | Question 29
6. GATE | GATE CS 1999 | Question 30
7. GATE | GATE CS 1999 | Question 31
8. GATE | GATE CS 1999 | Question 32
9. GATE | GATE CS 1999 | Question 57
10. GATE | GATE CS 1999 | Question 56
11. GATE | GATE CS 1999 | Question 48
12. GATE | GATE CS 1999 | Question 49
13. GATE | GATE CS 1999 | Question 1
14. GATE | GATE CS 1999 | Question 2
15. GATE | GATE CS 1999 | Question 3
16. GATE | GATE CS 1999 | Question 5
17. GATE | GATE CS 1999 | Question 6
18. GATE | GATE CS 1999 | Question 7
19. GATE | GATE CS 1999 | Question 8
20. GATE | GATE CS 1999 | Question 9
21. GATE | GATE CS 1999 | Question 10
22. GATE | GATE CS 1999 | Question 11
23. GATE | GATE CS 1999 | Question 12
24. GATE | GATE CS 1999 | Question 13
25. GATE | GATE CS 1999 | Question 14